./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/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 1f6e8c8b965f85c3429105401e9fda59f9f060cb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 16:40:40,108 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 16:40:40,109 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 16:40:40,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 16:40:40,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 16:40:40,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 16:40:40,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 16:40:40,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 16:40:40,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 16:40:40,123 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 16:40:40,124 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 16:40:40,124 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 16:40:40,125 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 16:40:40,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 16:40:40,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 16:40:40,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 16:40:40,127 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 16:40:40,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 16:40:40,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 16:40:40,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 16:40:40,131 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 16:40:40,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 16:40:40,132 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 16:40:40,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 16:40:40,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 16:40:40,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 16:40:40,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 16:40:40,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 16:40:40,134 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 16:40:40,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 16:40:40,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 16:40:40,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 16:40:40,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 16:40:40,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 16:40:40,136 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 16:40:40,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 16:40:40,137 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 16:40:40,144 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 16:40:40,144 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 16:40:40,145 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 16:40:40,145 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 16:40:40,145 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 16:40:40,146 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 16:40:40,146 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 16:40:40,146 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 16:40:40,146 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 16:40:40,146 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 16:40:40,146 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 16:40:40,146 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 16:40:40,146 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 16:40:40,146 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 16:40:40,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:40:40,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 16:40:40,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 16:40:40,148 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 16:40:40,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 16:40:40,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 16:40:40,148 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_3a1b318a-ed20-4f7a-8706-329b5f113210/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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-12-09 16:40:40,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 16:40:40,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 16:40:40,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 16:40:40,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 16:40:40,178 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 16:40:40,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:40:40,222 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/data/1994826be/357cf33981014ac6b766dda57630b7bf/FLAG370cc64dd [2018-12-09 16:40:40,691 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 16:40:40,692 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:40:40,698 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/data/1994826be/357cf33981014ac6b766dda57630b7bf/FLAG370cc64dd [2018-12-09 16:40:41,198 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/data/1994826be/357cf33981014ac6b766dda57630b7bf [2018-12-09 16:40:41,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 16:40:41,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 16:40:41,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 16:40:41,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 16:40:41,203 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 16:40:41,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495e205e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41, skipping insertion in model container [2018-12-09 16:40:41,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 16:40:41,229 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 16:40:41,390 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:40:41,398 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 16:40:41,457 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 16:40:41,482 INFO L195 MainTranslator]: Completed translation [2018-12-09 16:40:41,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41 WrapperNode [2018-12-09 16:40:41,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 16:40:41,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 16:40:41,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 16:40:41,483 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 16:40:41,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,495 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 16:40:41,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 16:40:41,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 16:40:41,500 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 16:40:41,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... [2018-12-09 16:40:41,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 16:40:41,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 16:40:41,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 16:40:41,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 16:40:41,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 16:40:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 16:40:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 16:40:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 16:40:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 16:40:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 16:40:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 16:40:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 16:40:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 16:40:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2018-12-09 16:40:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-12-09 16:40:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 16:40:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 16:40:41,717 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 16:40:41,717 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 16:40:41,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:40:41 BoogieIcfgContainer [2018-12-09 16:40:41,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 16:40:41,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 16:40:41,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 16:40:41,720 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 16:40:41,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:40:41" (1/3) ... [2018-12-09 16:40:41,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdd65f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:40:41, skipping insertion in model container [2018-12-09 16:40:41,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:40:41" (2/3) ... [2018-12-09 16:40:41,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdd65f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:40:41, skipping insertion in model container [2018-12-09 16:40:41,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:40:41" (3/3) ... [2018-12-09 16:40:41,722 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 16:40:41,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 16:40:41,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 16:40:41,743 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 16:40:41,758 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 16:40:41,758 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 16:40:41,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 16:40:41,759 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 16:40:41,759 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 16:40:41,759 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 16:40:41,759 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 16:40:41,759 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 16:40:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-09 16:40:41,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 16:40:41,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:41,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:41,775 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:41,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:41,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1933593497, now seen corresponding path program 1 times [2018-12-09 16:40:41,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:41,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:41,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:41,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:41,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:40:41,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:41,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:40:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:40:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:40:41,894 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-12-09 16:40:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:41,938 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-09 16:40:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:40:41,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 16:40:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:41,945 INFO L225 Difference]: With dead ends: 48 [2018-12-09 16:40:41,945 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 16:40:41,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:40:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 16:40:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 16:40:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 16:40:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-09 16:40:41,973 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-09 16:40:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:41,973 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 16:40:41,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:40:41,974 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-09 16:40:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 16:40:41,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:41,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:41,974 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:41,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1933593498, now seen corresponding path program 1 times [2018-12-09 16:40:41,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:41,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:41,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:40:42,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:40:42,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:40:42,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:40:42,027 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-12-09 16:40:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,043 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 16:40:42,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:40:42,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 16:40:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,044 INFO L225 Difference]: With dead ends: 44 [2018-12-09 16:40:42,045 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 16:40:42,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:40:42,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 16:40:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 16:40:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 16:40:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 16:40:42,049 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-12-09 16:40:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,049 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 16:40:42,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:40:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 16:40:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 16:40:42,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash -188143745, now seen corresponding path program 1 times [2018-12-09 16:40:42,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 16:40:42,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:40:42,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:40:42,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:40:42,076 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-12-09 16:40:42,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,100 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-09 16:40:42,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:40:42,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 16:40:42,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,101 INFO L225 Difference]: With dead ends: 43 [2018-12-09 16:40:42,101 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 16:40:42,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:40:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 16:40:42,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 16:40:42,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:40:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 16:40:42,105 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-09 16:40:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,105 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 16:40:42,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:40:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 16:40:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 16:40:42,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,106 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,106 INFO L82 PathProgramCache]: Analyzing trace with hash -188143744, now seen corresponding path program 1 times [2018-12-09 16:40:42,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:40:42,132 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:40:42,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:40:42,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:40:42,133 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-09 16:40:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,144 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-09 16:40:42,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:40:42,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 16:40:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,145 INFO L225 Difference]: With dead ends: 42 [2018-12-09 16:40:42,145 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 16:40:42,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:40:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 16:40:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 16:40:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 16:40:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 16:40:42,149 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-12-09 16:40:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,149 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 16:40:42,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:40:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 16:40:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 16:40:42,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,150 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash -57929344, now seen corresponding path program 1 times [2018-12-09 16:40:42,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 16:40:42,183 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 16:40:42,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 16:40:42,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 16:40:42,184 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-09 16:40:42,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,224 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 16:40:42,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 16:40:42,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 16:40:42,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,226 INFO L225 Difference]: With dead ends: 40 [2018-12-09 16:40:42,226 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 16:40:42,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-09 16:40:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 16:40:42,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 16:40:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 16:40:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 16:40:42,229 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-09 16:40:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,230 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 16:40:42,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 16:40:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 16:40:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 16:40:42,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,231 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash -57929343, now seen corresponding path program 1 times [2018-12-09 16:40:42,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 16:40:42,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 16:40:42,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 16:40:42,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 16:40:42,302 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-09 16:40:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,366 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-09 16:40:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:40:42,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 16:40:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,368 INFO L225 Difference]: With dead ends: 62 [2018-12-09 16:40:42,369 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 16:40:42,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 16:40:42,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 16:40:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-09 16:40:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:40:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-09 16:40:42,373 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-12-09 16:40:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,373 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-09 16:40:42,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 16:40:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 16:40:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:40:42,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,374 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash -852752314, now seen corresponding path program 1 times [2018-12-09 16:40:42,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 16:40:42,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 16:40:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 16:40:42,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 16:40:42,410 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-12-09 16:40:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,456 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-09 16:40:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 16:40:42,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 16:40:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,457 INFO L225 Difference]: With dead ends: 43 [2018-12-09 16:40:42,457 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 16:40:42,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:40:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 16:40:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-09 16:40:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 16:40:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-09 16:40:42,459 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-12-09 16:40:42,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,459 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-09 16:40:42,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 16:40:42,460 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-09 16:40:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 16:40:42,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,460 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash -852752313, now seen corresponding path program 1 times [2018-12-09 16:40:42,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 16:40:42,511 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 16:40:42,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 16:40:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 16:40:42,512 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-12-09 16:40:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,583 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-09 16:40:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 16:40:42,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 16:40:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,585 INFO L225 Difference]: With dead ends: 55 [2018-12-09 16:40:42,585 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 16:40:42,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:40:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 16:40:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-09 16:40:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 16:40:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-09 16:40:42,587 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-12-09 16:40:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,588 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-09 16:40:42,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 16:40:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-09 16:40:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 16:40:42,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,589 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,589 INFO L82 PathProgramCache]: Analyzing trace with hash 826540276, now seen corresponding path program 1 times [2018-12-09 16:40:42,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:40:42,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 16:40:42,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 16:40:42,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:40:42,625 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-12-09 16:40:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,665 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-09 16:40:42,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 16:40:42,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 16:40:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,666 INFO L225 Difference]: With dead ends: 46 [2018-12-09 16:40:42,666 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 16:40:42,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 16:40:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 16:40:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 16:40:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 16:40:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-09 16:40:42,668 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-09 16:40:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,668 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-09 16:40:42,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 16:40:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-09 16:40:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 16:40:42,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,669 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -875762082, now seen corresponding path program 1 times [2018-12-09 16:40:42,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:42,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 16:40:42,689 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:42,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 16:40:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 16:40:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:40:42,689 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-09 16:40:42,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:42,694 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-09 16:40:42,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 16:40:42,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 16:40:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:42,695 INFO L225 Difference]: With dead ends: 43 [2018-12-09 16:40:42,695 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 16:40:42,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 16:40:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 16:40:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 16:40:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:40:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-09 16:40:42,697 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-12-09 16:40:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:42,697 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-09 16:40:42,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 16:40:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 16:40:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 16:40:42,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:42,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:42,698 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:42,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash 200370203, now seen corresponding path program 1 times [2018-12-09 16:40:42,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:42,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:42,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:42,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:42,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:42,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:40:42,862 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 16:40:42,864 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [22], [29], [33], [40], [41], [44], [49], [51], [52], [55], [56], [59], [67], [85], [86], [87], [89] [2018-12-09 16:40:42,884 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:40:42,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:40:43,030 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:40:43,031 INFO L272 AbstractInterpreter]: Visited 24 different actions 38 times. Merged at 7 different actions 14 times. Never widened. Performed 330 root evaluator evaluations with a maximum evaluation depth of 6. Performed 330 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 16:40:43,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:43,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:40:43,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:43,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:40:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:43,045 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:40:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:43,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:40:43,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 16:40:43,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 16:40:43,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 16:40:43,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 16:40:43,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-09 16:40:43,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-12-09 16:40:43,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:40:43,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 16:40:43,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-12-09 16:40:43,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-12-09 16:40:43,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 16:40:43,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 16:40:43,260 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,264 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-12-09 16:40:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:40:43,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:40:43,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 16:40:43,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 16:40:43,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:43,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-12-09 16:40:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:40:43,380 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 16:40:43,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [11] total 22 [2018-12-09 16:40:43,381 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:43,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 16:40:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 16:40:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-12-09 16:40:43,381 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 9 states. [2018-12-09 16:40:45,886 WARN L180 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 16:40:48,850 WARN L180 SmtUtils]: Spent 2.95 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 16:40:48,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:48,868 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-09 16:40:48,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 16:40:48,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-09 16:40:48,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:48,868 INFO L225 Difference]: With dead ends: 51 [2018-12-09 16:40:48,869 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 16:40:48,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-09 16:40:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 16:40:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 16:40:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 16:40:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 16:40:48,879 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-12-09 16:40:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:48,879 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 16:40:48,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 16:40:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 16:40:48,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 16:40:48,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:48,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:48,880 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:48,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:48,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1793774503, now seen corresponding path program 1 times [2018-12-09 16:40:48,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:48,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:48,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:48,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:48,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:49,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:49,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:40:49,045 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 16:40:49,045 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [33], [40], [41], [44], [49], [51], [52], [55], [56], [59], [67], [85], [86], [87], [89] [2018-12-09 16:40:49,046 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:40:49,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:40:49,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:40:49,131 INFO L272 AbstractInterpreter]: Visited 24 different actions 45 times. Merged at 7 different actions 21 times. Widened at 1 different actions 1 times. Performed 408 root evaluator evaluations with a maximum evaluation depth of 6. Performed 408 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 16:40:49,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:49,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:40:49,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:49,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:40:49,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:49,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:40:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:49,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:40:49,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:40:49,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:40:49,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:49,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:49,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:40:49,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 16:40:49,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-09 16:40:49,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:40:49,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:40:49,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:40:49,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:40:49,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 16:40:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:49,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:40:49,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 16:40:49,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:49,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 16:40:49,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 16:40:49,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:49,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:49,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:49,551 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 16:40:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:49,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:40:49,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2018-12-09 16:40:49,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:40:49,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 16:40:49,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 16:40:49,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-12-09 16:40:49,571 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 19 states. [2018-12-09 16:40:51,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:51,346 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-12-09 16:40:51,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 16:40:51,347 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-09 16:40:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:51,347 INFO L225 Difference]: With dead ends: 67 [2018-12-09 16:40:51,348 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 16:40:51,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 16:40:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 16:40:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-12-09 16:40:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 16:40:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-09 16:40:51,350 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 24 [2018-12-09 16:40:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:51,350 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-09 16:40:51,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 16:40:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-09 16:40:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 16:40:51,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:51,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:51,351 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:51,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:51,351 INFO L82 PathProgramCache]: Analyzing trace with hash 408019855, now seen corresponding path program 1 times [2018-12-09 16:40:51,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:51,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:51,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:51,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 16:40:51,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 16:40:51,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 16:40:51,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 16:40:51,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 16:40:51,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 16:40:51,396 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 10 states. [2018-12-09 16:40:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:51,493 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-12-09 16:40:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 16:40:51,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-09 16:40:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:51,493 INFO L225 Difference]: With dead ends: 54 [2018-12-09 16:40:51,493 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 16:40:51,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-09 16:40:51,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 16:40:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-09 16:40:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 16:40:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-12-09 16:40:51,495 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2018-12-09 16:40:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:51,496 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-12-09 16:40:51,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 16:40:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-12-09 16:40:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 16:40:51,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:51,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:51,496 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:51,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash -354296782, now seen corresponding path program 1 times [2018-12-09 16:40:51,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:51,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:51,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:51,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:51,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:40:51,656 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 16:40:51,656 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [33], [35], [40], [41], [44], [49], [52], [55], [56], [59], [65], [71], [77], [79], [85], [86], [87], [89] [2018-12-09 16:40:51,657 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 16:40:51,657 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 16:40:51,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 16:40:51,723 INFO L272 AbstractInterpreter]: Visited 27 different actions 69 times. Merged at 14 different actions 42 times. Widened at 1 different actions 1 times. Performed 582 root evaluator evaluations with a maximum evaluation depth of 6. Performed 582 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-09 16:40:51,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:51,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 16:40:51,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:51,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:40:51,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:51,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 16:40:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:51,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:40:51,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 16:40:51,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:51,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:51,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 16:40:51,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:40:51,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:40:51,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:51,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:51,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:40:51,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 16:40:51,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 16:40:51,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:40:51,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:51,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:51,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 16:40:51,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 16:40:53,337 WARN L180 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-09 16:40:53,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-12-09 16:40:53,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2018-12-09 16:40:53,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:40:53,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-12-09 16:40:53,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-09 16:40:53,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-09 16:40:53,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:53,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-09 16:40:53,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:53,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-09 16:40:53,584 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:53,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-12-09 16:40:53,643 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 16:40:53,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-09 16:40:53,698 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:53,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 16:40:53,700 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:53,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-12-09 16:40:53,759 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-09 16:40:53,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-09 16:40:53,825 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:53,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-09 16:40:53,826 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:53,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-09 16:40:53,828 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:53,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 16:40:53,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 16:40:53,917 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-09 16:40:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:53,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:40:54,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:40:54,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:54,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-09 16:40:54,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-09 16:40:54,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:54,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-09 16:40:54,548 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:54,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:54,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:54,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-12-09 16:40:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:54,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:40:54,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2018-12-09 16:40:54,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:40:54,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 16:40:54,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 16:40:54,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2018-12-09 16:40:54,580 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 28 states. [2018-12-09 16:40:56,347 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-12-09 16:40:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:57,018 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-12-09 16:40:57,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 16:40:57,019 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-09 16:40:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:57,019 INFO L225 Difference]: With dead ends: 109 [2018-12-09 16:40:57,019 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 16:40:57,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=442, Invalid=2420, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 16:40:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 16:40:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-12-09 16:40:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 16:40:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-12-09 16:40:57,022 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 27 [2018-12-09 16:40:57,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:57,023 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-12-09 16:40:57,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 16:40:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-12-09 16:40:57,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 16:40:57,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:57,023 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 16:40:57,023 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:57,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:57,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1717586259, now seen corresponding path program 2 times [2018-12-09 16:40:57,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:57,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:57,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 16:40:57,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:57,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:57,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:57,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:57,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:40:57,190 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:40:57,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:40:57,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:57,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:40:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:40:57,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:40:57,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 16:40:57,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:40:57,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:40:57,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 16:40:57,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:40:57,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 16:40:57,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:40:57,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 16:40:57,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 16:40:57,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 16:40:57,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:40:57,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-09 16:40:57,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 16:40:57,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-09 16:40:57,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2018-12-09 16:40:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:40:57,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:40:57,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 16:40:57,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 16:40:57,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:57,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-09 16:40:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:40:57,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:40:57,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2018-12-09 16:40:57,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:40:57,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 16:40:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 16:40:57,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-12-09 16:40:57,752 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 22 states. [2018-12-09 16:40:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:40:59,117 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-12-09 16:40:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 16:40:59,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-12-09 16:40:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:40:59,118 INFO L225 Difference]: With dead ends: 92 [2018-12-09 16:40:59,118 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 16:40:59,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=543, Invalid=2427, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 16:40:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 16:40:59,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-12-09 16:40:59,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 16:40:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-12-09 16:40:59,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 30 [2018-12-09 16:40:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:40:59,121 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-12-09 16:40:59,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 16:40:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-12-09 16:40:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 16:40:59,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:40:59,121 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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] [2018-12-09 16:40:59,122 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:40:59,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:40:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1058353633, now seen corresponding path program 2 times [2018-12-09 16:40:59,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:40:59,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:59,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:40:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:40:59,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:40:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:40:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:40:59,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:59,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:40:59,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:40:59,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:40:59,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:40:59,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:40:59,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 16:40:59,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 16:40:59,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 16:40:59,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:40:59,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:40:59,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 16:40:59,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:59,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:59,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 16:40:59,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 16:40:59,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:40:59,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:59,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:59,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:40:59,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 16:40:59,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 16:40:59,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 16:40:59,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:40:59,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:40:59,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 16:40:59,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-12-09 16:41:00,733 WARN L180 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-09 16:41:00,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-12-09 16:41:00,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-12-09 16:41:00,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:00,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-12-09 16:41:00,803 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-09 16:41:00,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 16:41:00,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 16:41:00,848 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:78, output treesize:81 [2018-12-09 16:41:00,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:41:00,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:41:02,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 16:41:02,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:02,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-12-09 16:41:02,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-12-09 16:41:02,472 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:02,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-09 16:41:02,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:02,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:41:02,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:41:02,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:24 [2018-12-09 16:41:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:41:02,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:41:02,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 20] total 48 [2018-12-09 16:41:02,539 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:41:02,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 16:41:02,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 16:41:02,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2136, Unknown=0, NotChecked=0, Total=2352 [2018-12-09 16:41:02,540 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 31 states. [2018-12-09 16:41:04,470 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2018-12-09 16:41:06,818 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2018-12-09 16:41:08,252 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2018-12-09 16:41:09,245 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 86 [2018-12-09 16:41:11,055 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-12-09 16:41:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:41:11,350 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-12-09 16:41:11,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 16:41:11,350 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-12-09 16:41:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:41:11,351 INFO L225 Difference]: With dead ends: 98 [2018-12-09 16:41:11,351 INFO L226 Difference]: Without dead ends: 98 [2018-12-09 16:41:11,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=787, Invalid=4760, Unknown=3, NotChecked=0, Total=5550 [2018-12-09 16:41:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-09 16:41:11,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 57. [2018-12-09 16:41:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 16:41:11,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-09 16:41:11,353 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 40 [2018-12-09 16:41:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:41:11,354 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-09 16:41:11,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 16:41:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-09 16:41:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 16:41:11,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 16:41:11,354 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-12-09 16:41:11,354 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION]=== [2018-12-09 16:41:11,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 16:41:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash -586865326, now seen corresponding path program 3 times [2018-12-09 16:41:11,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 16:41:11,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:41:11,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 16:41:11,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 16:41:11,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 16:41:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 16:41:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 16:41:11,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:41:11,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 16:41:11,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 16:41:11,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 16:41:11,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 16:41:11,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 16:41:11,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 16:41:11,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 16:41:11,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 16:41:11,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 16:41:11,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 16:41:11,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 16:41:11,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 16:41:11,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 16:41:11,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 16:41:11,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 16:41:11,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 16:41:11,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 16:41:11,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 16:41:11,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 16:41:11,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:41:11,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 16:41:11,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-09 16:41:13,627 WARN L180 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 16:41:13,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-09 16:41:13,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-09 16:41:13,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:13,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 16:41:13,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 16:41:13,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:41:13,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 16:41:13,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2018-12-09 16:41:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:41:14,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 16:41:14,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-09 16:41:14,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-09 16:41:14,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 16:41:14,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 16:41:14,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 16:41:14,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:74 [2018-12-09 16:41:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 16:41:14,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 16:41:14,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 56 [2018-12-09 16:41:14,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 16:41:14,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-09 16:41:14,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-09 16:41:14,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2889, Unknown=4, NotChecked=0, Total=3192 [2018-12-09 16:41:14,943 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 39 states. [2018-12-09 16:41:16,402 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2018-12-09 16:41:17,155 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2018-12-09 16:41:17,462 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-09 16:41:17,758 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-12-09 16:41:18,014 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-09 16:41:18,875 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2018-12-09 16:41:19,164 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-12-09 16:41:19,543 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2018-12-09 16:41:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 16:41:21,291 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-09 16:41:21,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-09 16:41:21,292 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-12-09 16:41:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 16:41:21,292 INFO L225 Difference]: With dead ends: 113 [2018-12-09 16:41:21,292 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 16:41:21,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2714, Invalid=9938, Unknown=4, NotChecked=0, Total=12656 [2018-12-09 16:41:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 16:41:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 16:41:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 16:41:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 16:41:21,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-12-09 16:41:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 16:41:21,294 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 16:41:21,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-09 16:41:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 16:41:21,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 16:41:21,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:41:21 BoogieIcfgContainer [2018-12-09 16:41:21,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 16:41:21,298 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 16:41:21,298 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 16:41:21,298 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 16:41:21,298 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:40:41" (3/4) ... [2018-12-09 16:41:21,300 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 16:41:21,304 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 16:41:21,304 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 16:41:21,304 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2018-12-09 16:41:21,307 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 16:41:21,308 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 16:41:21,308 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 16:41:21,333 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3a1b318a-ed20-4f7a-8706-329b5f113210/bin-2019/utaipan/witness.graphml [2018-12-09 16:41:21,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 16:41:21,334 INFO L168 Benchmark]: Toolchain (without parser) took 40134.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 320.3 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -98.2 MB). Peak memory consumption was 222.2 MB. Max. memory is 11.5 GB. [2018-12-09 16:41:21,335 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:41:21,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.5 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -96.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:41:21,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 16:41:21,335 INFO L168 Benchmark]: Boogie Preprocessor took 17.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. [2018-12-09 16:41:21,335 INFO L168 Benchmark]: RCFGBuilder took 199.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:41:21,336 INFO L168 Benchmark]: TraceAbstraction took 39579.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -42.0 MB). Peak memory consumption was 212.8 MB. Max. memory is 11.5 GB. [2018-12-09 16:41:21,336 INFO L168 Benchmark]: Witness Printer took 36.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2018-12-09 16:41:21,337 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.5 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -96.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 199.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39579.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 254.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -42.0 MB). Peak memory consumption was 212.8 MB. Max. memory is 11.5 GB. * Witness Printer took 36.11 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 15 error locations. SAFE Result, 39.5s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 26.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 519 SDtfs, 1757 SDslu, 2113 SDs, 0 SdLazy, 3543 SolverSat, 359 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 670 GetRequests, 260 SyntacticMatches, 12 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4597 ImplicationChecksByTransitivity, 32.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 171 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 569 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 738 ConstructedInterpolants, 176 QuantifiedInterpolants, 499327 SizeOfPredicates, 130 NumberOfNonLiveVariables, 950 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 34/206 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...