./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-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_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/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 cbb495583d601bf9f19d9da57531415381b22d5a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 07:23:37,574 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:23:37,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:23:37,582 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:23:37,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:23:37,583 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:23:37,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:23:37,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:23:37,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:23:37,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:23:37,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:23:37,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:23:37,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:23:37,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:23:37,589 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:23:37,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:23:37,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:23:37,591 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:23:37,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:23:37,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:23:37,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:23:37,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:23:37,596 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:23:37,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:23:37,597 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:23:37,597 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:23:37,598 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:23:37,599 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:23:37,599 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:23:37,600 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:23:37,600 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:23:37,600 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:23:37,601 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:23:37,601 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:23:37,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:23:37,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:23:37,602 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-03 07:23:37,611 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:23:37,611 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:23:37,612 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:23:37,612 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:23:37,612 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:23:37,612 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:23:37,612 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:23:37,612 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:23:37,612 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:23:37,612 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:23:37,612 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:23:37,613 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:23:37,613 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:23:37,613 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 07:23:37,613 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 07:23:37,613 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:23:37,613 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:23:37,613 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 07:23:37,613 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:23:37,613 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:23:37,613 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:23:37,614 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:23:37,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:23:37,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:23:37,615 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:23:37,615 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:23:37,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:23:37,615 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_697024b7-6eaf-4eed-b2dc-b678a9647dee/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 -> cbb495583d601bf9f19d9da57531415381b22d5a [2018-12-03 07:23:37,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:23:37,639 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:23:37,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:23:37,642 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:23:37,642 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:23:37,643 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-03 07:23:37,679 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/data/eca56b78c/8466243d59c3406f9970eb28d25e52c5/FLAG19134bfff [2018-12-03 07:23:38,138 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:23:38,139 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-03 07:23:38,144 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/data/eca56b78c/8466243d59c3406f9970eb28d25e52c5/FLAG19134bfff [2018-12-03 07:23:38,153 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/data/eca56b78c/8466243d59c3406f9970eb28d25e52c5 [2018-12-03 07:23:38,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:23:38,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:23:38,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:23:38,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:23:38,158 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:23:38,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7c88b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38, skipping insertion in model container [2018-12-03 07:23:38,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:23:38,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:23:38,322 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:23:38,328 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:23:38,391 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:23:38,411 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:23:38,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38 WrapperNode [2018-12-03 07:23:38,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:23:38,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:23:38,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:23:38,412 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:23:38,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:23:38,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:23:38,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:23:38,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:23:38,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... [2018-12-03 07:23:38,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:23:38,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:23:38,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:23:38,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:23:38,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/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-03 07:23:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:23:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 07:23:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-12-03 07:23:38,475 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-12-03 07:23:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:23:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 07:23:38,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 07:23:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 07:23:38,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 07:23:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:23:38,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:23:38,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:23:38,613 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:23:38,613 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 07:23:38,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:23:38 BoogieIcfgContainer [2018-12-03 07:23:38,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:23:38,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:23:38,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:23:38,615 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:23:38,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:23:38" (1/3) ... [2018-12-03 07:23:38,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6ed034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:23:38, skipping insertion in model container [2018-12-03 07:23:38,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:23:38" (2/3) ... [2018-12-03 07:23:38,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6ed034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:23:38, skipping insertion in model container [2018-12-03 07:23:38,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:23:38" (3/3) ... [2018-12-03 07:23:38,617 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-12-03 07:23:38,623 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:23:38,627 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-03 07:23:38,635 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-03 07:23:38,650 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:23:38,650 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-03 07:23:38,650 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:23:38,650 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:23:38,650 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:23:38,650 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:23:38,650 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:23:38,650 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:23:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-12-03 07:23:38,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 07:23:38,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:38,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:38,667 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:38,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:38,670 INFO L82 PathProgramCache]: Analyzing trace with hash 460461903, now seen corresponding path program 1 times [2018-12-03 07:23:38,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:38,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:38,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:38,767 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-03 07:23:38,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:38,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:23:38,768 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:38,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:23:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:23:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:23:38,781 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 3 states. [2018-12-03 07:23:38,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:38,823 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-12-03 07:23:38,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:23:38,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 07:23:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:38,833 INFO L225 Difference]: With dead ends: 44 [2018-12-03 07:23:38,833 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 07:23:38,834 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-03 07:23:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 07:23:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 07:23:38,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 07:23:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-12-03 07:23:38,858 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 10 [2018-12-03 07:23:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:38,858 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-12-03 07:23:38,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:23:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-12-03 07:23:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 07:23:38,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:38,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:38,859 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:38,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash 460461904, now seen corresponding path program 1 times [2018-12-03 07:23:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:38,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:38,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:38,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:38,893 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-03 07:23:38,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:38,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:23:38,893 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:38,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:23:38,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:23:38,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:23:38,895 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 4 states. [2018-12-03 07:23:38,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:38,911 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-03 07:23:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:23:38,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 07:23:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:38,913 INFO L225 Difference]: With dead ends: 40 [2018-12-03 07:23:38,913 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 07:23:38,913 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-03 07:23:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 07:23:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 07:23:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 07:23:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-03 07:23:38,917 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 10 [2018-12-03 07:23:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:38,918 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-03 07:23:38,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:23:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-03 07:23:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 07:23:38,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:38,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:38,918 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:38,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1389417133, now seen corresponding path program 1 times [2018-12-03 07:23:38,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:38,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:38,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:38,947 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-03 07:23:38,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:38,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 07:23:38,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:38,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:23:38,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:23:38,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:23:38,948 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 3 states. [2018-12-03 07:23:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:38,969 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-12-03 07:23:38,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:23:38,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 07:23:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:38,970 INFO L225 Difference]: With dead ends: 39 [2018-12-03 07:23:38,970 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 07:23:38,970 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-03 07:23:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 07:23:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 07:23:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 07:23:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-12-03 07:23:38,973 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 11 [2018-12-03 07:23:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:38,974 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-12-03 07:23:38,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:23:38,974 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-12-03 07:23:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 07:23:38,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:38,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:38,975 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:38,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:38,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1389417134, now seen corresponding path program 1 times [2018-12-03 07:23:38,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:38,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:38,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:38,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:38,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:39,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:23:39,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:23:39,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:23:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:23:39,021 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2018-12-03 07:23:39,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,041 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-03 07:23:39,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:23:39,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-03 07:23:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,042 INFO L225 Difference]: With dead ends: 38 [2018-12-03 07:23:39,042 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 07:23:39,042 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-03 07:23:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 07:23:39,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 07:23:39,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 07:23:39,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-03 07:23:39,044 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 11 [2018-12-03 07:23:39,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,045 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-03 07:23:39,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:23:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-03 07:23:39,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 07:23:39,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:39,045 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1526014239, now seen corresponding path program 1 times [2018-12-03 07:23:39,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,079 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-03 07:23:39,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:23:39,079 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:23:39,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:23:39,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:23:39,080 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-12-03 07:23:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,127 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-03 07:23:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:23:39,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-03 07:23:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,128 INFO L225 Difference]: With dead ends: 36 [2018-12-03 07:23:39,129 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 07:23:39,129 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-03 07:23:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 07:23:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 07:23:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 07:23:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-12-03 07:23:39,132 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 14 [2018-12-03 07:23:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,132 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-12-03 07:23:39,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:23:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-12-03 07:23:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 07:23:39,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:39,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1526014240, now seen corresponding path program 1 times [2018-12-03 07:23:39,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,199 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-03 07:23:39,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:23:39,199 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:23:39,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:23:39,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:23:39,200 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 7 states. [2018-12-03 07:23:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,274 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-12-03 07:23:39,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:23:39,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-03 07:23:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,276 INFO L225 Difference]: With dead ends: 50 [2018-12-03 07:23:39,276 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 07:23:39,276 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-03 07:23:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 07:23:39,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-12-03 07:23:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 07:23:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-03 07:23:39,280 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2018-12-03 07:23:39,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,280 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-03 07:23:39,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:23:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-03 07:23:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 07:23:39,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:39,281 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1915835104, now seen corresponding path program 1 times [2018-12-03 07:23:39,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,310 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-03 07:23:39,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:23:39,310 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:23:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:23:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:23:39,311 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 6 states. [2018-12-03 07:23:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,359 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-03 07:23:39,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:23:39,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-12-03 07:23:39,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,360 INFO L225 Difference]: With dead ends: 40 [2018-12-03 07:23:39,360 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 07:23:39,360 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-03 07:23:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 07:23:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 07:23:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 07:23:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-03 07:23:39,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 16 [2018-12-03 07:23:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,363 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-03 07:23:39,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:23:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-03 07:23:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 07:23:39,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:39,363 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1915835105, now seen corresponding path program 1 times [2018-12-03 07:23:39,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,425 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-03 07:23:39,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:23:39,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:23:39,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:23:39,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:23:39,427 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 8 states. [2018-12-03 07:23:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,508 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-03 07:23:39,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:23:39,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-12-03 07:23:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,509 INFO L225 Difference]: With dead ends: 40 [2018-12-03 07:23:39,509 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 07:23:39,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:23:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 07:23:39,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 07:23:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 07:23:39,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-03 07:23:39,512 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 16 [2018-12-03 07:23:39,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,512 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-03 07:23:39,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:23:39,512 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-03 07:23:39,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 07:23:39,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,513 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-03 07:23:39,513 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1423435423, now seen corresponding path program 1 times [2018-12-03 07:23:39,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,547 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-03 07:23:39,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:23:39,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:23:39,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:23:39,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:23:39,548 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-12-03 07:23:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,595 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-03 07:23:39,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:23:39,595 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-03 07:23:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,595 INFO L225 Difference]: With dead ends: 39 [2018-12-03 07:23:39,596 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 07:23:39,596 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-03 07:23:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 07:23:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 07:23:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 07:23:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-03 07:23:39,598 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-12-03 07:23:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,598 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-03 07:23:39,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:23:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-03 07:23:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 07:23:39,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,599 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-03 07:23:39,599 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1423435422, now seen corresponding path program 1 times [2018-12-03 07:23:39,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,643 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-03 07:23:39,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:23:39,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:23:39,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:23:39,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:23:39,644 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 7 states. [2018-12-03 07:23:39,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,692 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-03 07:23:39,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:23:39,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-03 07:23:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,693 INFO L225 Difference]: With dead ends: 48 [2018-12-03 07:23:39,693 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 07:23:39,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:23:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 07:23:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-12-03 07:23:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 07:23:39,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-03 07:23:39,695 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-12-03 07:23:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,696 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-03 07:23:39,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:23:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-03 07:23:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:23:39,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,696 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-03 07:23:39,697 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,697 INFO L82 PathProgramCache]: Analyzing trace with hash -2121891282, now seen corresponding path program 1 times [2018-12-03 07:23:39,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,721 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-03 07:23:39,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:23:39,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:23:39,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:23:39,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:23:39,723 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2018-12-03 07:23:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,764 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-03 07:23:39,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:23:39,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-03 07:23:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,765 INFO L225 Difference]: With dead ends: 39 [2018-12-03 07:23:39,765 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 07:23:39,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-03 07:23:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 07:23:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 07:23:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 07:23:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-03 07:23:39,767 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 20 [2018-12-03 07:23:39,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,767 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-03 07:23:39,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:23:39,767 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-03 07:23:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:23:39,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,768 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-03 07:23:39,768 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2121891281, now seen corresponding path program 1 times [2018-12-03 07:23:39,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:39,850 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-03 07:23:39,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:39,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 07:23:39,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:39,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:23:39,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:23:39,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:23:39,851 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 10 states. [2018-12-03 07:23:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:39,947 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-12-03 07:23:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:23:39,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-03 07:23:39,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:39,948 INFO L225 Difference]: With dead ends: 47 [2018-12-03 07:23:39,948 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 07:23:39,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:23:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 07:23:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-12-03 07:23:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 07:23:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-03 07:23:39,951 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-12-03 07:23:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:39,951 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-03 07:23:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:23:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-03 07:23:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:23:39,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:39,951 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-03 07:23:39,951 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:39,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2121841552, now seen corresponding path program 1 times [2018-12-03 07:23:39,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:39,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:39,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:39,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:40,046 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-03 07:23:40,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:40,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 07:23:40,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:40,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 07:23:40,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 07:23:40,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-03 07:23:40,047 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2018-12-03 07:23:40,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:40,124 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-03 07:23:40,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:23:40,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-12-03 07:23:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:40,125 INFO L225 Difference]: With dead ends: 64 [2018-12-03 07:23:40,125 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 07:23:40,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-03 07:23:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 07:23:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2018-12-03 07:23:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 07:23:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-12-03 07:23:40,130 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2018-12-03 07:23:40,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:40,130 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-12-03 07:23:40,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 07:23:40,130 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-12-03 07:23:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:23:40,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:40,131 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-03 07:23:40,131 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:40,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1162008494, now seen corresponding path program 1 times [2018-12-03 07:23:40,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:40,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:40,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:40,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:40,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:40,279 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-03 07:23:40,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:40,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:23:40,280 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 07:23:40,281 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [10], [11], [18], [19], [25], [41], [46], [50], [54], [55], [58], [65], [66], [67], [69] [2018-12-03 07:23:40,315 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:23:40,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:23:40,439 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:23:40,440 INFO L272 AbstractInterpreter]: Visited 20 different actions 34 times. Merged at 7 different actions 14 times. Never widened. Performed 312 root evaluator evaluations with a maximum evaluation depth of 3. Performed 312 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-03 07:23:40,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:40,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:23:40,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:40,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/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-03 07:23:40,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:40,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:23:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:40,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:23:40,508 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 11 treesize of output 8 [2018-12-03 07:23:40,509 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-03 07:23:40,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-03 07:23:40,624 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 26 [2018-12-03 07:23:40,627 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 22 treesize of output 15 [2018-12-03 07:23:40,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,635 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 0 case distinctions, treesize of input 18 treesize of output 3 [2018-12-03 07:23:40,636 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-12-03 07:23:40,654 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-03 07:23:40,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:23:40,736 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-03 07:23:40,743 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-03 07:23:40,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:40,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-12-03 07:23:40,748 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-03 07:23:40,763 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:23:40,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [9] total 23 [2018-12-03 07:23:40,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:40,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 07:23:40,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 07:23:40,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-12-03 07:23:40,764 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 11 states. [2018-12-03 07:23:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:40,914 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-12-03 07:23:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:23:40,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 07:23:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:40,915 INFO L225 Difference]: With dead ends: 96 [2018-12-03 07:23:40,915 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 07:23:40,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2018-12-03 07:23:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 07:23:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 59. [2018-12-03 07:23:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 07:23:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-12-03 07:23:40,918 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 20 [2018-12-03 07:23:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:40,918 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-12-03 07:23:40,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 07:23:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-12-03 07:23:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 07:23:40,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:40,919 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-03 07:23:40,919 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:40,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 575202480, now seen corresponding path program 1 times [2018-12-03 07:23:40,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:40,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:40,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:41,037 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-03 07:23:41,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:41,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:23:41,037 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 07:23:41,037 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [9], [10], [11], [18], [19], [25], [41], [46], [52], [54], [55], [58], [65], [66], [67], [69] [2018-12-03 07:23:41,039 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:23:41,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:23:41,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:23:41,103 INFO L272 AbstractInterpreter]: Visited 20 different actions 41 times. Merged at 7 different actions 21 times. Widened at 1 different actions 1 times. Performed 394 root evaluator evaluations with a maximum evaluation depth of 3. Performed 394 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-03 07:23:41,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:41,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:23:41,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:41,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/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-03 07:23:41,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:41,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:23:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:41,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:23:41,132 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-03 07:23:41,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-03 07:23:41,151 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-03 07:23:41,152 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-03 07:23:41,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,158 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-03 07:23:41,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-03 07:23:41,179 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-03 07:23:41,180 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-03 07:23:41,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,192 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-03 07:23:41,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-03 07:23:41,293 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 30 treesize of output 28 [2018-12-03 07:23:41,294 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-03 07:23:41,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,302 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 16 treesize of output 13 [2018-12-03 07:23:41,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:41,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:23:41,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:23:41,315 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-03 07:23:41,343 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-03 07:23:41,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:23:41,483 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-03 07:23:41,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,489 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-03 07:23:41,495 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-03 07:23:41,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:41,501 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-03 07:23:41,505 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-03 07:23:41,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:23:41,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2018-12-03 07:23:41,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:23:41,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 07:23:41,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 07:23:41,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-12-03 07:23:41,521 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 17 states. [2018-12-03 07:23:42,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:42,046 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-12-03 07:23:42,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:23:42,047 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-12-03 07:23:42,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:42,047 INFO L225 Difference]: With dead ends: 77 [2018-12-03 07:23:42,048 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 07:23:42,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2018-12-03 07:23:42,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 07:23:42,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-12-03 07:23:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 07:23:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-12-03 07:23:42,052 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 20 [2018-12-03 07:23:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:42,053 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-12-03 07:23:42,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 07:23:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-12-03 07:23:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 07:23:42,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:42,054 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:42,054 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:42,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:42,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1281199503, now seen corresponding path program 1 times [2018-12-03 07:23:42,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:42,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:42,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:42,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:42,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:42,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:42,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:23:42,239 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 07:23:42,239 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [10], [11], [13], [18], [19], [25], [41], [46], [52], [54], [55], [58], [65], [66], [67], [69] [2018-12-03 07:23:42,240 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:23:42,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:23:42,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:23:42,284 INFO L272 AbstractInterpreter]: Visited 20 different actions 34 times. Merged at 7 different actions 14 times. Never widened. Performed 305 root evaluator evaluations with a maximum evaluation depth of 3. Performed 305 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-03 07:23:42,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:42,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:23:42,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:42,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/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-03 07:23:42,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:42,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:23:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:42,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:23:42,312 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-03 07:23:42,313 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-03 07:23:42,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:42,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:42,327 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-03 07:23:42,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-03 07:23:42,520 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 31 treesize of output 31 [2018-12-03 07:23:42,526 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 27 treesize of output 25 [2018-12-03 07:23:42,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:42,539 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 19 treesize of output 14 [2018-12-03 07:23:42,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:42,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-03 07:23:42,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:42,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-12-03 07:23:42,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:42,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:23:42,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:23:42,585 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-12-03 07:23:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:42,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:23:42,955 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-03 07:23:42,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:42,972 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-03 07:23:43,004 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-03 07:23:43,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:43,019 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 16 treesize of output 14 [2018-12-03 07:23:43,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:43,031 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-03 07:23:43,031 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:43,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:43,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:43,043 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-12-03 07:23:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:43,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:23:43,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2018-12-03 07:23:43,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:23:43,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 07:23:43,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 07:23:43,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2018-12-03 07:23:43,069 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 22 states. [2018-12-03 07:23:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:45,193 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-12-03 07:23:45,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 07:23:45,194 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 07:23:45,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:45,196 INFO L225 Difference]: With dead ends: 65 [2018-12-03 07:23:45,196 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 07:23:45,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 07:23:45,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 07:23:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 07:23:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 07:23:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-12-03 07:23:45,205 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 22 [2018-12-03 07:23:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:45,206 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-12-03 07:23:45,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 07:23:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-12-03 07:23:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 07:23:45,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:45,208 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] [2018-12-03 07:23:45,209 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:45,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1546966779, now seen corresponding path program 1 times [2018-12-03 07:23:45,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:45,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:45,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:45,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:45,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:45,260 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-03 07:23:45,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:23:45,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:23:45,261 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:45,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:23:45,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:23:45,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:23:45,261 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 4 states. [2018-12-03 07:23:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:45,290 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2018-12-03 07:23:45,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:23:45,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-03 07:23:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:45,290 INFO L225 Difference]: With dead ends: 64 [2018-12-03 07:23:45,291 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 07:23:45,291 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-03 07:23:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 07:23:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 07:23:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 07:23:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-03 07:23:45,292 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 23 [2018-12-03 07:23:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:45,292 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-03 07:23:45,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:23:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-03 07:23:45,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 07:23:45,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:45,292 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:45,292 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:45,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:45,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1422890226, now seen corresponding path program 1 times [2018-12-03 07:23:45,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:45,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:45,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:45,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:45,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:45,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:45,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:23:45,349 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-03 07:23:45,349 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [10], [11], [18], [19], [21], [25], [41], [46], [52], [54], [55], [58], [65], [66], [67], [69] [2018-12-03 07:23:45,350 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:23:45,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:23:45,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:23:45,375 INFO L272 AbstractInterpreter]: Visited 20 different actions 38 times. Merged at 7 different actions 18 times. Never widened. Performed 366 root evaluator evaluations with a maximum evaluation depth of 3. Performed 366 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-03 07:23:45,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:45,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:23:45,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:45,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/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-03 07:23:45,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:45,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:23:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:45,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:23:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:45,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:23:45,423 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 8 treesize of output 6 [2018-12-03 07:23:45,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:45,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:45,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-03 07:23:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:45,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:23:45,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-12-03 07:23:45,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:23:45,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:23:45,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:23:45,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:23:45,457 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 10 states. [2018-12-03 07:23:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:45,531 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-03 07:23:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:23:45,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-03 07:23:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:45,532 INFO L225 Difference]: With dead ends: 36 [2018-12-03 07:23:45,532 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 07:23:45,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-12-03 07:23:45,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 07:23:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-03 07:23:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 07:23:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 07:23:45,533 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2018-12-03 07:23:45,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:45,533 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 07:23:45,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:23:45,533 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 07:23:45,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 07:23:45,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:45,534 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:45,534 INFO L423 AbstractCegarLoop]: === Iteration 19 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:45,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1597856191, now seen corresponding path program 1 times [2018-12-03 07:23:45,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:45,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:45,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:45,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:45,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:45,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:45,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:23:45,594 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 07:23:45,594 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [7], [10], [11], [16], [18], [19], [25], [29], [32], [35], [41], [46], [52], [54], [55], [58], [65], [66], [67], [69] [2018-12-03 07:23:45,594 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 07:23:45,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 07:23:45,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 07:23:45,631 INFO L272 AbstractInterpreter]: Visited 23 different actions 57 times. Merged at 10 different actions 32 times. Never widened. Performed 565 root evaluator evaluations with a maximum evaluation depth of 3. Performed 565 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 28 variables. [2018-12-03 07:23:45,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:45,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 07:23:45,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:45,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/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-03 07:23:45,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:45,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 07:23:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:45,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:23:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:45,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:23:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-03 07:23:45,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:45,703 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-12-03 07:23:45,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:45,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:23:45,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-12-03 07:23:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:45,744 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 07:23:45,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 17 [2018-12-03 07:23:45,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:23:45,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:23:45,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:23:45,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-03 07:23:45,745 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 7 states. [2018-12-03 07:23:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:45,799 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 07:23:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:23:45,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 07:23:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:45,800 INFO L225 Difference]: With dead ends: 33 [2018-12-03 07:23:45,800 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 07:23:45,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-12-03 07:23:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 07:23:45,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 07:23:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 07:23:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 07:23:45,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2018-12-03 07:23:45,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:45,802 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 07:23:45,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:23:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 07:23:45,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 07:23:45,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:45,802 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] [2018-12-03 07:23:45,802 INFO L423 AbstractCegarLoop]: === Iteration 20 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:45,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:45,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1597905920, now seen corresponding path program 2 times [2018-12-03 07:23:45,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:45,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:45,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:23:45,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:45,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:45,970 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-03 07:23:45,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:45,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:23:45,970 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:23:45,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:23:45,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:45,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/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-03 07:23:45,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:23:45,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 07:23:45,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 07:23:45,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:23:45,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:23:46,005 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-03 07:23:46,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,014 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-03 07:23:46,016 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-03 07:23:46,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,020 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,024 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-03 07:23:46,039 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 16 treesize of output 13 [2018-12-03 07:23:46,040 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-03 07:23:46,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-12-03 07:23:46,070 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 29 treesize of output 30 [2018-12-03 07:23:46,072 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-03 07:23:46,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,079 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-03 07:23:46,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-03 07:23:46,203 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 31 treesize of output 29 [2018-12-03 07:23:46,205 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 10 treesize of output 1 [2018-12-03 07:23:46,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,227 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-03 07:23:46,227 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:46,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:23:46,236 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-03 07:23:46,236 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-12-03 07:23:46,275 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-03 07:23:46,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:23:46,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-03 07:23:46,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-03 07:23:46,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:46,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2018-12-03 07:23:46,481 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-03 07:23:46,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:23:46,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2018-12-03 07:23:46,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:23:46,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 07:23:46,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 07:23:46,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2018-12-03 07:23:46,497 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 22 states. [2018-12-03 07:23:49,957 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 51 DAG size of output: 40 [2018-12-03 07:23:51,605 WARN L180 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-12-03 07:23:53,638 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-03 07:23:55,699 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 43 [2018-12-03 07:23:57,439 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-12-03 07:23:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:57,499 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 07:23:57,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 07:23:57,500 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-12-03 07:23:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:57,500 INFO L225 Difference]: With dead ends: 38 [2018-12-03 07:23:57,500 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 07:23:57,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 07:23:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 07:23:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-12-03 07:23:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 07:23:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 07:23:57,502 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 26 [2018-12-03 07:23:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:57,503 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 07:23:57,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 07:23:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 07:23:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 07:23:57,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:57,503 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:57,503 INFO L423 AbstractCegarLoop]: === Iteration 21 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:57,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2010704447, now seen corresponding path program 2 times [2018-12-03 07:23:57,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:57,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:23:57,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:57,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:57,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:57,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:23:57,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:23:57,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:23:57,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:57,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:23:57,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 07:23:57,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 07:23:57,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 07:23:57,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:23:57,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:23:57,763 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-03 07:23:57,771 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-03 07:23:57,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:57,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:23:57,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:23:57,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:28 [2018-12-03 07:23:57,805 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 15 treesize of output 12 [2018-12-03 07:23:57,806 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-03 07:23:57,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:57,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:57,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:57,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-03 07:23:57,961 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 32 treesize of output 32 [2018-12-03 07:23:57,963 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 28 treesize of output 21 [2018-12-03 07:23:57,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:57,976 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 21 treesize of output 19 [2018-12-03 07:23:57,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:57,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-03 07:23:57,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:58,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:23:58,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:23:58,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:59 [2018-12-03 07:23:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:58,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:23:58,502 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 32 treesize of output 34 [2018-12-03 07:23:58,536 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 28 treesize of output 16 [2018-12-03 07:23:58,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:58,549 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 16 treesize of output 12 [2018-12-03 07:23:58,549 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:58,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 [2018-12-03 07:23:58,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:58,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:58,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:23:58,583 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:83 [2018-12-03 07:23:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:58,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:23:58,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2018-12-03 07:23:58,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:23:58,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 07:23:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 07:23:58,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 07:23:58,667 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2018-12-03 07:23:59,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:23:59,302 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 07:23:59,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:23:59,302 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 28 [2018-12-03 07:23:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:23:59,302 INFO L225 Difference]: With dead ends: 37 [2018-12-03 07:23:59,302 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 07:23:59,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=279, Invalid=2271, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 07:23:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 07:23:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-03 07:23:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 07:23:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 07:23:59,304 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 28 [2018-12-03 07:23:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:23:59,304 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 07:23:59,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 07:23:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 07:23:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 07:23:59,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:23:59,304 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:23:59,305 INFO L423 AbstractCegarLoop]: === Iteration 22 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:23:59,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:23:59,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1327535952, now seen corresponding path program 3 times [2018-12-03 07:23:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:23:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:59,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:23:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:23:59,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:23:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:23:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 07:23:59,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:59,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:23:59,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:23:59,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:23:59,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:23:59,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:23:59,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:23:59,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 07:23:59,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:23:59,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:23:59,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:23:59,415 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-03 07:23:59,417 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-03 07:23:59,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,428 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-03 07:23:59,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,432 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-03 07:23:59,443 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-03 07:23:59,444 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-03 07:23:59,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-03 07:23:59,463 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-03 07:23:59,464 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-03 07:23:59,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,471 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-03 07:23:59,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-03 07:23:59,678 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 33 treesize of output 31 [2018-12-03 07:23:59,679 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 10 treesize of output 1 [2018-12-03 07:23:59,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:23:59,688 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 17 treesize of output 14 [2018-12-03 07:23:59,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 07:23:59,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:23:59,698 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-03 07:23:59,698 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-12-03 07:23:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:23:59,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:24:00,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-03 07:24:00,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-03 07:24:00,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:24:00,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:24:00,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:24:00,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-12-03 07:24:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:24:00,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:24:00,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 32 [2018-12-03 07:24:00,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:24:00,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 07:24:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 07:24:00,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 07:24:00,080 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 22 states. [2018-12-03 07:24:01,531 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 60 DAG size of output: 41 [2018-12-03 07:24:02,460 WARN L180 SmtUtils]: Spent 905.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-12-03 07:24:04,926 WARN L180 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 34 [2018-12-03 07:24:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:24:05,154 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 07:24:05,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 07:24:05,154 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-12-03 07:24:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:24:05,155 INFO L225 Difference]: With dead ends: 36 [2018-12-03 07:24:05,155 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 07:24:05,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 07:24:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 07:24:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-03 07:24:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 07:24:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 07:24:05,157 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-12-03 07:24:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:24:05,157 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 07:24:05,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 07:24:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 07:24:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 07:24:05,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:24:05,158 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:24:05,158 INFO L423 AbstractCegarLoop]: === Iteration 23 === [cstrcmpErr2REQUIRES_VIOLATION, cstrcmpErr3REQUIRES_VIOLATION, cstrcmpErr8REQUIRES_VIOLATION, cstrcmpErr9REQUIRES_VIOLATION, cstrcmpErr4REQUIRES_VIOLATION, cstrcmpErr5REQUIRES_VIOLATION, cstrcmpErr0REQUIRES_VIOLATION, cstrcmpErr1REQUIRES_VIOLATION, cstrcmpErr6REQUIRES_VIOLATION, cstrcmpErr7REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION]=== [2018-12-03 07:24:05,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:24:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash 156761361, now seen corresponding path program 3 times [2018-12-03 07:24:05,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:24:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:24:05,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:24:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:24:05,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:24:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:24:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 07:24:05,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:24:05,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 07:24:05,273 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 07:24:05,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 07:24:05,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 07:24:05,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 07:24:05,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 07:24:05,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 07:24:05,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 07:24:05,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 07:24:05,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 07:24:05,310 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-03 07:24:05,318 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-03 07:24:05,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-03 07:24:05,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 07:24:05,331 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-03 07:24:05,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-03 07:24:05,335 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 15 treesize of output 12 [2018-12-03 07:24:05,336 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-03 07:24:05,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:24:05,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:24:05,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:24:05,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-03 07:24:05,491 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 32 treesize of output 32 [2018-12-03 07:24:05,493 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 28 treesize of output 21 [2018-12-03 07:24:05,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:24:05,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-03 07:24:05,510 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 07:24:05,522 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 21 treesize of output 19 [2018-12-03 07:24:05,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 07:24:05,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 07:24:05,540 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-03 07:24:05,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-03 07:24:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:24:05,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 07:24:07,781 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 45 [2018-12-03 07:24:13,666 WARN L180 SmtUtils]: Spent 5.84 s on a formula simplification that was a NOOP. DAG size: 49 [2018-12-03 07:24:13,834 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 32 treesize of output 34 [2018-12-03 07:24:13,858 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 28 treesize of output 16 [2018-12-03 07:24:13,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 07:24:13,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 [2018-12-03 07:24:13,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 07:24:13,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 07:24:13,881 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-03 07:24:13,881 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:35 [2018-12-03 07:24:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:24:13,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 07:24:13,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 17] total 39 [2018-12-03 07:24:13,941 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 07:24:13,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 07:24:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 07:24:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 07:24:13,942 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 24 states. [2018-12-03 07:24:14,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:24:14,706 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 07:24:14,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 07:24:14,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-12-03 07:24:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:24:14,706 INFO L225 Difference]: With dead ends: 35 [2018-12-03 07:24:14,706 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 07:24:14,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=713, Invalid=3193, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 07:24:14,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 07:24:14,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 07:24:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 07:24:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 07:24:14,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-12-03 07:24:14,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:24:14,708 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 07:24:14,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 07:24:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 07:24:14,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 07:24:14,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:24:14 BoogieIcfgContainer [2018-12-03 07:24:14,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:24:14,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:24:14,711 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:24:14,711 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:24:14,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:23:38" (3/4) ... [2018-12-03 07:24:14,713 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 07:24:14,717 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 07:24:14,717 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcmp [2018-12-03 07:24:14,717 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 07:24:14,720 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2018-12-03 07:24:14,720 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-03 07:24:14,720 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 07:24:14,745 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_697024b7-6eaf-4eed-b2dc-b678a9647dee/bin-2019/utaipan/witness.graphml [2018-12-03 07:24:14,746 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:24:14,746 INFO L168 Benchmark]: Toolchain (without parser) took 36591.00 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 948.1 MB in the beginning and 923.5 MB in the end (delta: 24.6 MB). Peak memory consumption was 367.5 MB. Max. memory is 11.5 GB. [2018-12-03 07:24:14,747 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:24:14,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:24:14,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:24:14,748 INFO L168 Benchmark]: Boogie Preprocessor took 15.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:24:14,748 INFO L168 Benchmark]: RCFGBuilder took 169.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-12-03 07:24:14,748 INFO L168 Benchmark]: TraceAbstraction took 36096.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.1 GB in the beginning and 923.5 MB in the end (delta: 154.0 MB). Peak memory consumption was 375.8 MB. Max. memory is 11.5 GB. [2018-12-03 07:24:14,748 INFO L168 Benchmark]: Witness Printer took 34.83 ms. Allocated memory is still 1.4 GB. Free memory is still 923.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:24:14,749 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -155.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 169.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36096.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.8 MB). Free memory was 1.1 GB in the beginning and 923.5 MB in the end (delta: 154.0 MB). Peak memory consumption was 375.8 MB. Max. memory is 11.5 GB. * Witness Printer took 34.83 ms. Allocated memory is still 1.4 GB. Free memory is still 923.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 544]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 543]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 560]: 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, 45 locations, 15 error locations. SAFE Result, 36.0s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 546 SDtfs, 837 SDslu, 2128 SDs, 0 SdLazy, 2770 SolverSat, 160 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 741 GetRequests, 329 SyntacticMatches, 13 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2477 ImplicationChecksByTransitivity, 29.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 85 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 685 NumberOfCodeBlocks, 683 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 876 ConstructedInterpolants, 89 QuantifiedInterpolants, 265780 SizeOfPredicates, 146 NumberOfNonLiveVariables, 1422 ConjunctsInSsa, 349 ConjunctsInUnsatCore, 41 InterpolantComputations, 18 PerfectInterpolantSequences, 73/247 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...