./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.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_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/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 cfdde8b1798318c3bb26b76a748741913b280952 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/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 cfdde8b1798318c3bb26b76a748741913b280952 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:20:49,280 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:20:49,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:20:49,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:20:49,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:20:49,287 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:20:49,288 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:20:49,289 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:20:49,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:20:49,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:20:49,291 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:20:49,291 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:20:49,292 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:20:49,292 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:20:49,293 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:20:49,293 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:20:49,294 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:20:49,295 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:20:49,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:20:49,296 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:20:49,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:20:49,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:20:49,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:20:49,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:20:49,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:20:49,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:20:49,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:20:49,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:20:49,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:20:49,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:20:49,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:20:49,302 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:20:49,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:20:49,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:20:49,302 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:20:49,303 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:20:49,303 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 01:20:49,311 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:20:49,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:20:49,312 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:20:49,312 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:20:49,312 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:20:49,312 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:20:49,312 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:20:49,312 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 01:20:49,312 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:20:49,312 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:20:49,313 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 01:20:49,313 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 01:20:49,313 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:20:49,313 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:20:49,313 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:20:49,313 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:20:49,314 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:20:49,314 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:20:49,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:20:49,314 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:20:49,314 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:20:49,314 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:20:49,314 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:20:49,314 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:20:49,315 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:20:49,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 01:20:49,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:20:49,316 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 01:20:49,316 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_a6851681-aea2-4385-a905-dcb7bd478156/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 -> cfdde8b1798318c3bb26b76a748741913b280952 [2018-12-09 01:20:49,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:20:49,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:20:49,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:20:49,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:20:49,346 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:20:49,347 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:20:49,387 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data/4b6dfc65b/210bf9d3042d4889a3b02c30ad52b80c/FLAG8c8f2e632 [2018-12-09 01:20:49,851 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:20:49,852 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:20:49,858 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data/4b6dfc65b/210bf9d3042d4889a3b02c30ad52b80c/FLAG8c8f2e632 [2018-12-09 01:20:50,368 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data/4b6dfc65b/210bf9d3042d4889a3b02c30ad52b80c [2018-12-09 01:20:50,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:20:50,371 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:20:50,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:20:50,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:20:50,375 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:20:50,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44149d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50, skipping insertion in model container [2018-12-09 01:20:50,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:20:50,406 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:20:50,578 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:20:50,619 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:20:50,647 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:20:50,671 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:20:50,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50 WrapperNode [2018-12-09 01:20:50,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:20:50,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:20:50,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:20:50,672 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:20:50,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:20:50,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:20:50,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:20:50,690 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:20:50,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... [2018-12-09 01:20:50,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:20:50,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:20:50,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:20:50,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:20:50,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:20:50,741 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 01:20:50,742 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 01:20:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 01:20:50,742 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 01:20:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:20:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 01:20:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-09 01:20:50,742 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-09 01:20:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 01:20:50,742 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-09 01:20:50,743 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-09 01:20:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:20:50,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:20:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:20:50,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:20:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:20:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:20:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:20:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 01:20:50,743 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 01:20:50,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:20:50,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:20:50,947 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:20:50,947 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 01:20:50,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:20:50 BoogieIcfgContainer [2018-12-09 01:20:50,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:20:50,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:20:50,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:20:50,950 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:20:50,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:20:50" (1/3) ... [2018-12-09 01:20:50,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185c4f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:20:50, skipping insertion in model container [2018-12-09 01:20:50,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:20:50" (2/3) ... [2018-12-09 01:20:50,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185c4f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:20:50, skipping insertion in model container [2018-12-09 01:20:50,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:20:50" (3/3) ... [2018-12-09 01:20:50,953 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:20:50,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:20:50,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-09 01:20:50,972 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-09 01:20:50,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:20:50,986 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:20:50,986 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:20:50,986 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:20:50,986 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:20:50,986 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:20:50,986 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:20:50,987 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:20:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2018-12-09 01:20:51,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:20:51,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:51,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:51,003 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:51,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash 645081098, now seen corresponding path program 1 times [2018-12-09 01:20:51,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:51,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:20:51,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:20:51,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:20:51,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:20:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:20:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:20:51,123 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 3 states. [2018-12-09 01:20:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:51,177 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-12-09 01:20:51,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:20:51,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 01:20:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:51,185 INFO L225 Difference]: With dead ends: 84 [2018-12-09 01:20:51,185 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 01:20:51,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:20:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 01:20:51,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-12-09 01:20:51,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 01:20:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-12-09 01:20:51,210 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 11 [2018-12-09 01:20:51,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:51,210 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-12-09 01:20:51,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:20:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-12-09 01:20:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:20:51,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:51,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:51,211 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:51,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:51,212 INFO L82 PathProgramCache]: Analyzing trace with hash 645081099, now seen corresponding path program 1 times [2018-12-09 01:20:51,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:51,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:51,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:20:51,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:20:51,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:20:51,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:20:51,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:20:51,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:20:51,255 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 3 states. [2018-12-09 01:20:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:51,278 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-09 01:20:51,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:20:51,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 01:20:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:51,279 INFO L225 Difference]: With dead ends: 74 [2018-12-09 01:20:51,279 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 01:20:51,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:20:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 01:20:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-12-09 01:20:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 01:20:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-09 01:20:51,283 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 11 [2018-12-09 01:20:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:51,283 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-09 01:20:51,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:20:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-09 01:20:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:20:51,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:51,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:51,284 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:51,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash -379752050, now seen corresponding path program 1 times [2018-12-09 01:20:51,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:51,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:51,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:20:51,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:20:51,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:20:51,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:20:51,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:20:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:20:51,313 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 3 states. [2018-12-09 01:20:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:51,329 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-12-09 01:20:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:20:51,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 01:20:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:51,330 INFO L225 Difference]: With dead ends: 80 [2018-12-09 01:20:51,330 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 01:20:51,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:20:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 01:20:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-12-09 01:20:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 01:20:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-09 01:20:51,335 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 15 [2018-12-09 01:20:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:51,335 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-09 01:20:51,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:20:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-09 01:20:51,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:20:51,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:51,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:51,335 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:51,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:51,336 INFO L82 PathProgramCache]: Analyzing trace with hash -888134484, now seen corresponding path program 1 times [2018-12-09 01:20:51,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:51,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:51,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:20:51,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:20:51,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:20:51,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:20:51,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:20:51,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:20:51,368 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-12-09 01:20:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:51,392 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-12-09 01:20:51,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:20:51,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 01:20:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:51,393 INFO L225 Difference]: With dead ends: 80 [2018-12-09 01:20:51,393 INFO L226 Difference]: Without dead ends: 77 [2018-12-09 01:20:51,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:20:51,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-09 01:20:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-09 01:20:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 01:20:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2018-12-09 01:20:51,399 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 18 [2018-12-09 01:20:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:51,399 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2018-12-09 01:20:51,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:20:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2018-12-09 01:20:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:20:51,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:51,400 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:51,400 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1185765675, now seen corresponding path program 1 times [2018-12-09 01:20:51,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:51,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:51,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:51,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:51,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:20:51,473 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 01:20:51,474 INFO L205 CegarAbsIntRunner]: [43], [108], [109], [115], [124], [130], [132], [135], [138], [143], [145], [148], [150], [159], [169], [170], [171] [2018-12-09 01:20:51,494 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:20:51,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:20:51,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:20:51,602 INFO L272 AbstractInterpreter]: Visited 17 different actions 24 times. Merged at 6 different actions 6 times. Never widened. Performed 255 root evaluator evaluations with a maximum evaluation depth of 3. Performed 255 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-09 01:20:51,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:51,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:20:51,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:51,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:20:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:51,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:20:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:51,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:20:51,673 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 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-09 01:20:51,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:51,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:51,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-09 01:20:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:51,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:20:51,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:51,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:20:51,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-09 01:20:51,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:20:51,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:20:51,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:20:51,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:20:51,728 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 6 states. [2018-12-09 01:20:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:51,793 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-09 01:20:51,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:20:51,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 01:20:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:51,794 INFO L225 Difference]: With dead ends: 76 [2018-12-09 01:20:51,794 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 01:20:51,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:20:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 01:20:51,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-12-09 01:20:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 01:20:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-12-09 01:20:51,797 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 22 [2018-12-09 01:20:51,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:51,798 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-12-09 01:20:51,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:20:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-12-09 01:20:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:20:51,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:51,799 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:51,799 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:51,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1185765674, now seen corresponding path program 1 times [2018-12-09 01:20:51,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:51,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:51,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:51,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:51,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:51,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:20:51,882 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-09 01:20:51,882 INFO L205 CegarAbsIntRunner]: [43], [108], [109], [115], [124], [130], [132], [135], [138], [143], [146], [148], [150], [159], [169], [170], [171] [2018-12-09 01:20:51,883 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:20:51,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:20:51,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:20:51,918 INFO L272 AbstractInterpreter]: Visited 17 different actions 24 times. Merged at 6 different actions 6 times. Never widened. Performed 256 root evaluator evaluations with a maximum evaluation depth of 3. Performed 256 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-09 01:20:51,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:51,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:20:51,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:51,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:20:51,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:51,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:20:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:51,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:20:52,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:52,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:52,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:20:52,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:52,018 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 14 treesize of output 17 [2018-12-09 01:20:52,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:52,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:20:52,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-12-09 01:20:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:52,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:20:52,127 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 7 treesize of output 5 [2018-12-09 01:20:52,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:52,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:52,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-12-09 01:20:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:52,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:20:52,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2018-12-09 01:20:52,161 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:20:52,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:20:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:20:52,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:20:52,161 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 11 states. [2018-12-09 01:20:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:52,277 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-12-09 01:20:52,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:20:52,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-09 01:20:52,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:52,278 INFO L225 Difference]: With dead ends: 79 [2018-12-09 01:20:52,278 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 01:20:52,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-12-09 01:20:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 01:20:52,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2018-12-09 01:20:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:20:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-12-09 01:20:52,282 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 22 [2018-12-09 01:20:52,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:52,282 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-12-09 01:20:52,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:20:52,282 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-12-09 01:20:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 01:20:52,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:52,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:52,283 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:52,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:52,283 INFO L82 PathProgramCache]: Analyzing trace with hash 322115077, now seen corresponding path program 1 times [2018-12-09 01:20:52,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:52,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:52,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:52,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:20:52,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:20:52,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:20:52,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:20:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:20:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:20:52,331 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-12-09 01:20:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:52,479 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-12-09 01:20:52,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:20:52,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-09 01:20:52,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:52,480 INFO L225 Difference]: With dead ends: 80 [2018-12-09 01:20:52,480 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 01:20:52,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:20:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 01:20:52,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-12-09 01:20:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 01:20:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-12-09 01:20:52,483 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 25 [2018-12-09 01:20:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:52,484 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-12-09 01:20:52,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:20:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-12-09 01:20:52,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 01:20:52,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:52,484 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:52,484 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:52,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash 322115078, now seen corresponding path program 1 times [2018-12-09 01:20:52,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:52,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:52,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:52,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:52,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:52,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:20:52,523 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-09 01:20:52,523 INFO L205 CegarAbsIntRunner]: [0], [7], [19], [43], [45], [53], [108], [109], [115], [122], [124], [130], [132], [135], [138], [148], [150], [154], [155], [159], [160], [161], [169], [170], [171] [2018-12-09 01:20:52,525 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:20:52,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:20:52,556 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 01:20:52,556 INFO L272 AbstractInterpreter]: Visited 16 different actions 23 times. Merged at 6 different actions 6 times. Never widened. Performed 249 root evaluator evaluations with a maximum evaluation depth of 3. Performed 249 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-12-09 01:20:52,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:52,561 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 01:20:52,612 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 76.36% of their original sizes. [2018-12-09 01:20:52,613 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 01:20:52,658 INFO L418 sIntCurrentIteration]: We unified 24 AI predicates to 24 [2018-12-09 01:20:52,658 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 01:20:52,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 01:20:52,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2018-12-09 01:20:52,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:20:52,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:20:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:20:52,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:20:52,659 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 9 states. [2018-12-09 01:20:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:52,892 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-12-09 01:20:52,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:20:52,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-12-09 01:20:52,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:52,893 INFO L225 Difference]: With dead ends: 86 [2018-12-09 01:20:52,893 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 01:20:52,893 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:20:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 01:20:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-12-09 01:20:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 01:20:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-12-09 01:20:52,897 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 25 [2018-12-09 01:20:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:52,897 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-12-09 01:20:52,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:20:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-12-09 01:20:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 01:20:52,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:52,898 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:52,898 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:52,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:52,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1328238362, now seen corresponding path program 1 times [2018-12-09 01:20:52,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:52,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:52,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:52,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:20:52,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:20:52,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:20:52,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:20:52,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:20:52,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:20:52,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:20:52,934 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 6 states. [2018-12-09 01:20:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:52,973 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-12-09 01:20:52,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:20:52,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-09 01:20:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:52,974 INFO L225 Difference]: With dead ends: 84 [2018-12-09 01:20:52,974 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 01:20:52,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:20:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 01:20:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-12-09 01:20:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 01:20:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2018-12-09 01:20:52,978 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 33 [2018-12-09 01:20:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:52,978 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2018-12-09 01:20:52,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:20:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2018-12-09 01:20:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 01:20:52,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:52,979 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:52,979 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:52,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1328238417, now seen corresponding path program 1 times [2018-12-09 01:20:52,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:52,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:52,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:52,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:20:53,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:20:53,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:20:53,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:20:53,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:20:53,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:20:53,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:20:53,062 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand 9 states. [2018-12-09 01:20:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:53,192 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-12-09 01:20:53,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:20:53,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-09 01:20:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:53,193 INFO L225 Difference]: With dead ends: 84 [2018-12-09 01:20:53,193 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 01:20:53,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:20:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 01:20:53,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-12-09 01:20:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 01:20:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-12-09 01:20:53,196 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 33 [2018-12-09 01:20:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:53,196 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-12-09 01:20:53,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:20:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-12-09 01:20:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 01:20:53,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:53,196 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:53,197 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:53,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash 16935945, now seen corresponding path program 1 times [2018-12-09 01:20:53,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:53,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:53,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:53,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:53,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:53,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:53,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:20:53,391 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-09 01:20:53,392 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [18], [43], [45], [53], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [169], [170], [171] [2018-12-09 01:20:53,392 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:20:53,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:20:53,424 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:20:53,425 INFO L272 AbstractInterpreter]: Visited 30 different actions 51 times. Merged at 9 different actions 16 times. Never widened. Performed 514 root evaluator evaluations with a maximum evaluation depth of 4. Performed 514 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 3 different actions. Largest state had 27 variables. [2018-12-09 01:20:53,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:53,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:20:53,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:53,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:20:53,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:53,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:20:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:53,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:20:53,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:53,506 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:53,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:20:53,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 01:20:53,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:20:53,526 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:20:53,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-12-09 01:20:53,548 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 23 treesize of output 18 [2018-12-09 01:20:53,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:53,551 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 18 treesize of output 27 [2018-12-09 01:20:53,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 01:20:53,577 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-09 01:20:53,579 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 16 treesize of output 15 [2018-12-09 01:20:53,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:20:53,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-12-09 01:20:53,773 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 55 treesize of output 39 [2018-12-09 01:20:53,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:53,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2018-12-09 01:20:53,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:20:53,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:53,786 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:55, output treesize:5 [2018-12-09 01:20:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:53,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:20:54,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-09 01:20:54,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:54,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:20:54,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:19 [2018-12-09 01:20:54,120 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:20:54,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:54,121 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-09 01:20:54,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:1 [2018-12-09 01:20:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:20:54,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:20:54,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 34 [2018-12-09 01:20:54,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:20:54,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 01:20:54,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 01:20:54,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1094, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 01:20:54,141 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 27 states. [2018-12-09 01:20:54,884 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2018-12-09 01:20:56,115 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-12-09 01:20:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:20:56,581 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2018-12-09 01:20:56,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 01:20:56,581 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-12-09 01:20:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:20:56,582 INFO L225 Difference]: With dead ends: 126 [2018-12-09 01:20:56,582 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 01:20:56,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=385, Invalid=2921, Unknown=0, NotChecked=0, Total=3306 [2018-12-09 01:20:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 01:20:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 83. [2018-12-09 01:20:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 01:20:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2018-12-09 01:20:56,587 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 36 [2018-12-09 01:20:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:20:56,587 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2018-12-09 01:20:56,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 01:20:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2018-12-09 01:20:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 01:20:56,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:20:56,588 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:20:56,588 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:20:56,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:56,588 INFO L82 PathProgramCache]: Analyzing trace with hash 16935946, now seen corresponding path program 1 times [2018-12-09 01:20:56,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:20:56,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:56,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:56,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:20:56,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:20:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:56,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:56,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:56,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:20:56,836 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-09 01:20:56,836 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [19], [43], [45], [53], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [169], [170], [171] [2018-12-09 01:20:56,837 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:20:56,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:20:56,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:20:56,875 INFO L272 AbstractInterpreter]: Visited 30 different actions 65 times. Merged at 13 different actions 28 times. Never widened. Performed 645 root evaluator evaluations with a maximum evaluation depth of 4. Performed 645 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 4 different actions. Largest state had 27 variables. [2018-12-09 01:20:56,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:20:56,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:20:56,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:20:56,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:20:56,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:20:56,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:20:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:20:56,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:20:56,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:56,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:56,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:20:56,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:56,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:56,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 01:20:56,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:20:56,978 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:20:56,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:56,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:56,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:20:56,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:20:56,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:56,990 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:56,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:56,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-12-09 01:20:57,022 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 23 treesize of output 18 [2018-12-09 01:20:57,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:57,026 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 18 treesize of output 27 [2018-12-09 01:20:57,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,042 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 23 treesize of output 18 [2018-12-09 01:20:57,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:57,045 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 18 treesize of output 27 [2018-12-09 01:20:57,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-12-09 01:20:57,087 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 100 treesize of output 101 [2018-12-09 01:20:57,089 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 22 treesize of output 21 [2018-12-09 01:20:57,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,112 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2018-12-09 01:20:57,114 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 22 treesize of output 21 [2018-12-09 01:20:57,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:99 [2018-12-09 01:20:57,437 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 90 treesize of output 72 [2018-12-09 01:20:57,439 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 13 treesize of output 1 [2018-12-09 01:20:57,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:57,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2018-12-09 01:20:57,447 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,461 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 56 treesize of output 48 [2018-12-09 01:20:57,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 01:20:57,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:20:57,470 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2018-12-09 01:20:57,470 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,476 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:117, output treesize:11 [2018-12-09 01:20:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:57,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:20:57,953 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 48 treesize of output 52 [2018-12-09 01:20:57,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 01:20:57,962 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 28 treesize of output 26 [2018-12-09 01:20:57,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:57,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:20:57,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:60 [2018-12-09 01:20:58,065 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:20:58,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:58,070 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-09 01:20:58,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:20:58,086 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:58,091 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 20 treesize of output 16 [2018-12-09 01:20:58,093 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 16 treesize of output 3 [2018-12-09 01:20:58,093 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:20:58,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:20:58,100 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:20:58,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:20:58,113 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:120, output treesize:11 [2018-12-09 01:20:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:20:58,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:20:58,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 42 [2018-12-09 01:20:58,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:20:58,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 01:20:58,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 01:20:58,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1671, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 01:20:58,227 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 30 states. [2018-12-09 01:20:58,682 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-12-09 01:20:59,922 WARN L180 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 100 [2018-12-09 01:21:00,293 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-12-09 01:21:00,817 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-12-09 01:21:01,141 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-09 01:21:01,686 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-12-09 01:21:02,046 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-12-09 01:21:02,598 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2018-12-09 01:21:02,825 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-09 01:21:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:03,394 INFO L93 Difference]: Finished difference Result 186 states and 217 transitions. [2018-12-09 01:21:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 01:21:03,394 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 36 [2018-12-09 01:21:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:03,395 INFO L225 Difference]: With dead ends: 186 [2018-12-09 01:21:03,396 INFO L226 Difference]: Without dead ends: 186 [2018-12-09 01:21:03,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=510, Invalid=3912, Unknown=0, NotChecked=0, Total=4422 [2018-12-09 01:21:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-09 01:21:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 98. [2018-12-09 01:21:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-09 01:21:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions. [2018-12-09 01:21:03,401 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 36 [2018-12-09 01:21:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:03,401 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 116 transitions. [2018-12-09 01:21:03,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 01:21:03,401 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions. [2018-12-09 01:21:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 01:21:03,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:03,402 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:03,402 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:21:03,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2029185305, now seen corresponding path program 2 times [2018-12-09 01:21:03,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:21:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:03,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:21:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:21:03,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:03,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:21:03,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:21:03,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:21:03,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:21:03,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:21:03,437 INFO L87 Difference]: Start difference. First operand 98 states and 116 transitions. Second operand 7 states. [2018-12-09 01:21:03,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:03,468 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-12-09 01:21:03,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 01:21:03,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-12-09 01:21:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:03,469 INFO L225 Difference]: With dead ends: 74 [2018-12-09 01:21:03,469 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 01:21:03,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:21:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 01:21:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-09 01:21:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:21:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-09 01:21:03,471 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 39 [2018-12-09 01:21:03,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:03,471 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-09 01:21:03,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:21:03,472 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-09 01:21:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 01:21:03,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:03,472 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:03,473 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:21:03,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash -544417206, now seen corresponding path program 1 times [2018-12-09 01:21:03,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:21:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:03,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:21:03,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:03,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:21:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:21:03,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:03,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:21:03,511 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-12-09 01:21:03,511 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [17], [20], [43], [45], [51], [53], [56], [60], [66], [86], [95], [97], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [162], [165], [169], [170], [171] [2018-12-09 01:21:03,512 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:21:03,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:21:03,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:21:03,573 INFO L272 AbstractInterpreter]: Visited 40 different actions 117 times. Merged at 18 different actions 42 times. Never widened. Performed 1049 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1049 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 7 different actions. Largest state had 27 variables. [2018-12-09 01:21:03,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:03,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:21:03,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:03,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:03,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:03,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:21:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:03,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:21:03,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:21:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:21:03,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:21:03,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-12-09 01:21:03,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:21:03,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:21:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:21:03,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:21:03,683 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 10 states. [2018-12-09 01:21:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:03,803 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-12-09 01:21:03,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:21:03,804 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-12-09 01:21:03,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:03,804 INFO L225 Difference]: With dead ends: 89 [2018-12-09 01:21:03,804 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 01:21:03,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:21:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 01:21:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2018-12-09 01:21:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 01:21:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-09 01:21:03,806 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 46 [2018-12-09 01:21:03,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:03,806 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-09 01:21:03,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:21:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-09 01:21:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 01:21:03,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:03,807 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:03,807 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:21:03,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:03,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1196176101, now seen corresponding path program 1 times [2018-12-09 01:21:03,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:21:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:03,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:03,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:21:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:21:03,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:03,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 01:21:03,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:21:03,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:21:03,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:21:03,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:21:03,836 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2018-12-09 01:21:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:03,868 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-12-09 01:21:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 01:21:03,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-12-09 01:21:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:03,869 INFO L225 Difference]: With dead ends: 72 [2018-12-09 01:21:03,869 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 01:21:03,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:21:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 01:21:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-09 01:21:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 01:21:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-12-09 01:21:03,872 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 47 [2018-12-09 01:21:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:03,872 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-12-09 01:21:03,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:21:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-12-09 01:21:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 01:21:03,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:03,873 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:03,873 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:21:03,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash -397462785, now seen corresponding path program 1 times [2018-12-09 01:21:03,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:21:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:03,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:03,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:03,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:21:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 01:21:03,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:03,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:21:03,968 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:21:03,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:21:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:21:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:21:03,969 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 9 states. [2018-12-09 01:21:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:04,074 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-12-09 01:21:04,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:21:04,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-12-09 01:21:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:04,075 INFO L225 Difference]: With dead ends: 78 [2018-12-09 01:21:04,075 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 01:21:04,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:21:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 01:21:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-12-09 01:21:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:21:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-09 01:21:04,077 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 54 [2018-12-09 01:21:04,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:04,077 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-09 01:21:04,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:21:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-09 01:21:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:21:04,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:04,077 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:04,078 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:21:04,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash 409590367, now seen corresponding path program 1 times [2018-12-09 01:21:04,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:21:04,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:04,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:04,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:04,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:21:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 01:21:04,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:21:04,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:21:04,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 01:21:04,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:21:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:21:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:21:04,116 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 9 states. [2018-12-09 01:21:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:04,193 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-09 01:21:04,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:21:04,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-12-09 01:21:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:04,194 INFO L225 Difference]: With dead ends: 77 [2018-12-09 01:21:04,194 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 01:21:04,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:21:04,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 01:21:04,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2018-12-09 01:21:04,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 01:21:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-09 01:21:04,196 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 57 [2018-12-09 01:21:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:04,197 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-09 01:21:04,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:21:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-09 01:21:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:21:04,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:04,197 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:04,198 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:21:04,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:04,198 INFO L82 PathProgramCache]: Analyzing trace with hash -121851382, now seen corresponding path program 1 times [2018-12-09 01:21:04,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:21:04,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:04,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:04,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:04,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:21:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:21:04,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:04,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:21:04,811 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-09 01:21:04,811 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [17], [20], [43], [45], [51], [53], [56], [60], [66], [86], [95], [96], [97], [99], [101], [103], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [162], [165], [169], [170], [171] [2018-12-09 01:21:04,812 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:21:04,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:21:04,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:21:04,869 INFO L272 AbstractInterpreter]: Visited 44 different actions 135 times. Merged at 23 different actions 55 times. Never widened. Performed 1185 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 14 fixpoints after 8 different actions. Largest state had 27 variables. [2018-12-09 01:21:04,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:04,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:21:04,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:04,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:21:04,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:04,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:21:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:04,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:04,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:04,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:04,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:21:04,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:04,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:04,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 01:21:05,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:21:05,034 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:21:05,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:05,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:05,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:05,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-09 01:21:05,064 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 23 treesize of output 18 [2018-12-09 01:21:05,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:05,067 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 18 treesize of output 27 [2018-12-09 01:21:05,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:05,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:05,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:05,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 01:21:05,108 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-12-09 01:21:05,109 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 16 treesize of output 15 [2018-12-09 01:21:05,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:05,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:05,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:05,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:41 [2018-12-09 01:21:06,294 WARN L180 SmtUtils]: Spent 873.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-09 01:21:06,301 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2018-12-09 01:21:06,308 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 32 treesize of output 21 [2018-12-09 01:21:06,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:06,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:21:06,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:06,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:85, output treesize:90 [2018-12-09 01:21:06,385 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 31 treesize of output 25 [2018-12-09 01:21:06,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:06,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-09 01:21:06,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:06,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:06,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:06,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-12-09 01:21:06,500 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 46 treesize of output 37 [2018-12-09 01:21:06,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:06,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:06,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:06,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-09 01:21:06,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:06,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:06,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:06,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:42 [2018-12-09 01:21:06,644 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 40 treesize of output 32 [2018-12-09 01:21:06,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:06,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-12-09 01:21:06,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 01:21:06,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 01:21:06,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 01:21:06,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:87 [2018-12-09 01:21:06,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:06,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 01:21:06,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:06,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:06,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-09 01:21:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:06,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:21:07,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:07,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:07,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:07,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:15 [2018-12-09 01:21:10,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:10,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:10,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:10,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2018-12-09 01:21:15,751 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 24 treesize of output 11 [2018-12-09 01:21:15,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-12-09 01:21:15,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:15,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:15,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:15,761 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:15,763 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:15,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:15,768 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:62, output treesize:68 [2018-12-09 01:21:17,980 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 18 treesize of output 11 [2018-12-09 01:21:17,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:17,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-09 01:21:17,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:17,993 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:17,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:17,996 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:17,998 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:18,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-09 01:21:18,005 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:75, output treesize:114 [2018-12-09 01:21:19,265 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 143 [2018-12-09 01:21:19,295 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 78 treesize of output 71 [2018-12-09 01:21:19,297 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,298 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 71 treesize of output 73 [2018-12-09 01:21:19,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,315 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 68 [2018-12-09 01:21:19,357 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 64 [2018-12-09 01:21:19,365 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:19,403 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,404 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 59 treesize of output 48 [2018-12-09 01:21:19,422 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2018-12-09 01:21:19,426 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:19,427 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2018-12-09 01:21:19,431 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:19,432 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2018-12-09 01:21:19,433 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,452 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:21:19,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:19,454 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-12-09 01:21:19,455 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 59 [2018-12-09 01:21:19,473 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,476 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 78 [2018-12-09 01:21:19,615 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 97 [2018-12-09 01:21:19,617 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,618 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-12-09 01:21:19,618 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:19,620 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-12-09 01:21:19,627 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-12-09 01:21:19,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 48 [2018-12-09 01:21:19,637 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-12-09 01:21:19,799 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,800 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 41 [2018-12-09 01:21:19,805 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:19,807 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,807 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2018-12-09 01:21:19,820 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 7 xjuncts. [2018-12-09 01:21:19,954 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,957 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 82 [2018-12-09 01:21:19,977 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 14 xjuncts. [2018-12-09 01:21:19,978 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,981 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:19,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2018-12-09 01:21:19,993 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-12-09 01:21:20,166 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,168 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2018-12-09 01:21:20,173 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:20,183 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 33 treesize of output 31 [2018-12-09 01:21:20,183 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:20,296 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2018-12-09 01:21:20,305 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 4 xjuncts. [2018-12-09 01:21:20,306 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,307 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2018-12-09 01:21:20,319 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 7 xjuncts. [2018-12-09 01:21:20,417 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-12-09 01:21:20,490 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 79 [2018-12-09 01:21:20,790 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 177 [2018-12-09 01:21:20,793 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2018-12-09 01:21:20,798 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:20,799 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,800 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-12-09 01:21:20,800 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:20,801 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:20,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2018-12-09 01:21:20,806 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:21,115 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:21,121 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:21,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 55 [2018-12-09 01:21:21,132 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-12-09 01:21:21,134 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:21,137 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:21,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 82 [2018-12-09 01:21:21,157 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 14 xjuncts. [2018-12-09 01:21:21,517 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:21,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2018-12-09 01:21:21,525 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 4 xjuncts. [2018-12-09 01:21:21,526 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:21,528 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:21,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2018-12-09 01:21:21,543 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 7 xjuncts. [2018-12-09 01:21:22,109 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:22,109 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:22,110 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:22,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 46 [2018-12-09 01:21:22,114 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:22,118 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 32 treesize of output 30 [2018-12-09 01:21:22,119 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:22,369 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:22,370 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-12-09 01:21:22,371 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:22,373 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:22,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 44 [2018-12-09 01:21:22,382 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-12-09 01:21:23,378 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:23,380 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:23,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 65 [2018-12-09 01:21:23,434 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 6 xjuncts. [2018-12-09 01:21:23,438 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:23,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2018-12-09 01:21:23,449 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-12-09 01:21:23,676 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:23,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 35 [2018-12-09 01:21:23,680 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:23,682 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:23,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 54 [2018-12-09 01:21:23,693 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 3 xjuncts. [2018-12-09 01:21:23,867 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:23,869 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:23,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2018-12-09 01:21:23,875 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:23,890 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 33 treesize of output 31 [2018-12-09 01:21:23,891 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:24,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 57 [2018-12-09 01:21:24,099 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 8 xjuncts. [2018-12-09 01:21:24,100 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 84 [2018-12-09 01:21:24,123 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 01:21:24,125 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 20 xjuncts. [2018-12-09 01:21:24,275 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 67 [2018-12-09 01:21:24,290 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 10 xjuncts. [2018-12-09 01:21:24,295 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 26 treesize of output 22 [2018-12-09 01:21:24,295 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:24,387 INFO L267 ElimStorePlain]: Start of recursive call 25: 11 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-12-09 01:21:24,459 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-12-09 01:21:24,533 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-12-09 01:21:24,670 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 46 treesize of output 40 [2018-12-09 01:21:24,672 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 52 [2018-12-09 01:21:24,745 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 57 [2018-12-09 01:21:24,757 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 3 xjuncts. [2018-12-09 01:21:24,758 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 57 [2018-12-09 01:21:24,770 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 3 xjuncts. [2018-12-09 01:21:24,771 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 40 [2018-12-09 01:21:24,779 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:24,845 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-12-09 01:21:24,851 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:24,855 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 22 treesize of output 18 [2018-12-09 01:21:24,855 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:24,898 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 22 treesize of output 18 [2018-12-09 01:21:24,899 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:24,900 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:24,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-12-09 01:21:24,904 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-12-09 01:21:24,931 INFO L267 ElimStorePlain]: Start of recursive call 48: 3 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 01:21:24,953 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 01:21:25,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 13 xjuncts. [2018-12-09 01:21:25,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 12 xjuncts. [2018-12-09 01:21:25,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-12-09 01:21:25,174 INFO L202 ElimStorePlain]: Needed 55 recursive calls to eliminate 5 variables, input treesize:236, output treesize:112 [2018-12-09 01:21:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:21:25,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 01:21:25,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28, 28] total 76 [2018-12-09 01:21:25,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 01:21:25,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-09 01:21:25,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-09 01:21:25,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=5547, Unknown=4, NotChecked=0, Total=5852 [2018-12-09 01:21:25,425 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 52 states. [2018-12-09 01:21:38,336 WARN L180 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2018-12-09 01:21:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:21:44,549 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2018-12-09 01:21:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 01:21:44,549 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 59 [2018-12-09 01:21:44,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:21:44,550 INFO L225 Difference]: With dead ends: 87 [2018-12-09 01:21:44,550 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 01:21:44,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 68 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2457 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=789, Invalid=9915, Unknown=8, NotChecked=0, Total=10712 [2018-12-09 01:21:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 01:21:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2018-12-09 01:21:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 01:21:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-12-09 01:21:44,553 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 59 [2018-12-09 01:21:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:21:44,553 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-12-09 01:21:44,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-09 01:21:44,553 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-12-09 01:21:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:21:44,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:21:44,553 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:21:44,553 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_update_atErr0REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION]=== [2018-12-09 01:21:44,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash -121851381, now seen corresponding path program 1 times [2018-12-09 01:21:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 01:21:44,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:44,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:44,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 01:21:44,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 01:21:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:45,083 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-12-09 01:21:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 01:21:45,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:45,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 01:21:45,851 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-09 01:21:45,851 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [10], [13], [17], [20], [43], [45], [51], [53], [56], [60], [66], [86], [95], [96], [98], [99], [101], [103], [108], [109], [115], [122], [124], [130], [132], [135], [138], [143], [144], [148], [150], [154], [155], [159], [160], [161], [162], [165], [169], [170], [171] [2018-12-09 01:21:45,852 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 01:21:45,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 01:21:45,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 01:21:45,929 INFO L272 AbstractInterpreter]: Visited 44 different actions 126 times. Merged at 23 different actions 47 times. Never widened. Performed 1121 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1121 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 13 fixpoints after 8 different actions. Largest state had 27 variables. [2018-12-09 01:21:45,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:21:45,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 01:21:45,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:21:45,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/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-09 01:21:45,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:21:45,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 01:21:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:21:45,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:21:45,967 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 6 treesize of output 5 [2018-12-09 01:21:45,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:45,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:45,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:21:45,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:45,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:45,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 01:21:45,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 01:21:46,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-09 01:21:46,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:21:46,071 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:21:46,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:21:46,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:21:46,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:42 [2018-12-09 01:21:46,135 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 23 treesize of output 18 [2018-12-09 01:21:46,137 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:46,138 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 18 treesize of output 27 [2018-12-09 01:21:46,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,159 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 23 treesize of output 18 [2018-12-09 01:21:46,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:46,161 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:21:46,161 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 18 treesize of output 36 [2018-12-09 01:21:46,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:60 [2018-12-09 01:21:46,221 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-12-09 01:21:46,223 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 14 treesize of output 13 [2018-12-09 01:21:46,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,246 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 42 treesize of output 43 [2018-12-09 01:21:46,247 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 14 treesize of output 13 [2018-12-09 01:21:46,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:86 [2018-12-09 01:21:46,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-12-09 01:21:46,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:46,493 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:21:46,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,497 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 5 treesize of output 1 [2018-12-09 01:21:46,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,510 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-09 01:21:46,511 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 5 treesize of output 1 [2018-12-09 01:21:46,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:21:46,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:21:46,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-09 01:21:46,518 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:46,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:46,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:21:46,528 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:92, output treesize:21 [2018-12-09 01:22:14,367 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 01:22:14,377 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 65 treesize of output 58 [2018-12-09 01:22:14,385 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 30 treesize of output 17 [2018-12-09 01:22:14,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:22:14,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:22:14,420 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 84 [2018-12-09 01:22:14,422 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 0 case distinctions, treesize of input 30 treesize of output 3 [2018-12-09 01:22:14,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,434 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 94 [2018-12-09 01:22:14,441 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 30 treesize of output 17 [2018-12-09 01:22:14,442 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 01:22:14,451 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:22:14,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:22:14,480 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:175 [2018-12-09 01:22:14,569 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 31 treesize of output 25 [2018-12-09 01:22:14,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-12-09 01:22:14,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:14,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:14,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 01:22:14,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,590 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:22:14,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:14,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:21 [2018-12-09 01:22:14,695 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 46 treesize of output 37 [2018-12-09 01:22:14,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-09 01:22:14,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,731 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 34 treesize of output 27 [2018-12-09 01:22:14,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 39 [2018-12-09 01:22:14,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:14,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:14,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:104, output treesize:74 [2018-12-09 01:22:14,916 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 40 treesize of output 32 [2018-12-09 01:22:14,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-12-09 01:22:14,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 01:22:14,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 01:22:14,981 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 28 treesize of output 22 [2018-12-09 01:22:14,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:14,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 33 [2018-12-09 01:22:14,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 01:22:14,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:22:15,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 8 xjuncts. [2018-12-09 01:22:15,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:78, output treesize:281 [2018-12-09 01:22:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 01:22:15,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:15,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:15,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:15,668 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:15,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:15,682 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:15,684 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:15,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:15,691 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:15,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 01:22:15,695 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:91, output treesize:34 [2018-12-09 01:22:17,793 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-09 01:22:19,918 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-09 01:22:19,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:19,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:19,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:19,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:19,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:19,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,008 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,013 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 01:22:20,028 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:117 [2018-12-09 01:22:20,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:20,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:20,432 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,433 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,442 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,444 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:20,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-09 01:22:20,449 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:172, output treesize:94 [2018-12-09 01:22:22,627 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-09 01:22:23,164 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-12-09 01:22:24,455 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 66 [2018-12-09 01:22:24,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-12-09 01:22:24,663 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:24,665 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 01:22:24,672 INFO L168 Benchmark]: Toolchain (without parser) took 94300.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.8 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 265.4 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:24,673 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:22:24,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:24,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.95 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:24,676 INFO L168 Benchmark]: Boogie Preprocessor took 19.25 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-09 01:22:24,676 INFO L168 Benchmark]: RCFGBuilder took 238.57 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:24,677 INFO L168 Benchmark]: TraceAbstraction took 93721.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 284.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.6 MB). Peak memory consumption was 260.1 MB. Max. memory is 11.5 GB. [2018-12-09 01:22:24,683 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 299.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.95 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.25 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 238.57 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93721.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 284.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.6 MB). Peak memory consumption was 260.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-09 01:22:25,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 01:22:25,920 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 01:22:25,926 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 01:22:25,926 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 01:22:25,927 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 01:22:25,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 01:22:25,928 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 01:22:25,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 01:22:25,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 01:22:25,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 01:22:25,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 01:22:25,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 01:22:25,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 01:22:25,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 01:22:25,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 01:22:25,932 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 01:22:25,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 01:22:25,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 01:22:25,934 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 01:22:25,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 01:22:25,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 01:22:25,936 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 01:22:25,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 01:22:25,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 01:22:25,937 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 01:22:25,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 01:22:25,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 01:22:25,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 01:22:25,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 01:22:25,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 01:22:25,939 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 01:22:25,939 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 01:22:25,939 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 01:22:25,940 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 01:22:25,940 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 01:22:25,940 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 01:22:25,948 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 01:22:25,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 01:22:25,948 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 01:22:25,948 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 01:22:25,948 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 01:22:25,949 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 01:22:25,949 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 01:22:25,949 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 01:22:25,949 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 01:22:25,949 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 01:22:25,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 01:22:25,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 01:22:25,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 01:22:25,950 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 01:22:25,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:22:25,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 01:22:25,951 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 01:22:25,952 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 01:22:25,952 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 01:22:25,952 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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_a6851681-aea2-4385-a905-dcb7bd478156/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 -> cfdde8b1798318c3bb26b76a748741913b280952 [2018-12-09 01:22:25,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 01:22:25,981 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 01:22:25,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 01:22:25,985 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 01:22:25,985 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 01:22:25,986 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:22:26,031 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data/50b6ecd02/e0d1cdeacc754a079bf0d6873445de80/FLAG624c16e29 [2018-12-09 01:22:26,365 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 01:22:26,365 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/sv-benchmarks/c/list-simple/dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:22:26,371 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data/50b6ecd02/e0d1cdeacc754a079bf0d6873445de80/FLAG624c16e29 [2018-12-09 01:22:26,379 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/data/50b6ecd02/e0d1cdeacc754a079bf0d6873445de80 [2018-12-09 01:22:26,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 01:22:26,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 01:22:26,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 01:22:26,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 01:22:26,384 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 01:22:26,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33327ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26, skipping insertion in model container [2018-12-09 01:22:26,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 01:22:26,409 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 01:22:26,570 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:22:26,578 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 01:22:26,650 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 01:22:26,673 INFO L195 MainTranslator]: Completed translation [2018-12-09 01:22:26,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26 WrapperNode [2018-12-09 01:22:26,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 01:22:26,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 01:22:26,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 01:22:26,674 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 01:22:26,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 01:22:26,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 01:22:26,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 01:22:26,692 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 01:22:26,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,700 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... [2018-12-09 01:22:26,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 01:22:26,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 01:22:26,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 01:22:26,713 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 01:22:26,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 01:22:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy [2018-12-09 01:22:26,744 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy [2018-12-09 01:22:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 01:22:26,744 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 01:22:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 01:22:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 01:22:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure dll_get_data_at [2018-12-09 01:22:26,744 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_get_data_at [2018-12-09 01:22:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure dll_update_at [2018-12-09 01:22:26,744 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_update_at [2018-12-09 01:22:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 01:22:26,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 01:22:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 01:22:26,744 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 01:22:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 01:22:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 01:22:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 01:22:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 01:22:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2018-12-09 01:22:26,745 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2018-12-09 01:22:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 01:22:26,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 01:22:27,010 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 01:22:27,010 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 01:22:27,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:22:27 BoogieIcfgContainer [2018-12-09 01:22:27,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 01:22:27,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 01:22:27,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 01:22:27,014 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 01:22:27,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:22:26" (1/3) ... [2018-12-09 01:22:27,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcbcd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:22:27, skipping insertion in model container [2018-12-09 01:22:27,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:22:26" (2/3) ... [2018-12-09 01:22:27,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcbcd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:22:27, skipping insertion in model container [2018-12-09 01:22:27,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:22:27" (3/3) ... [2018-12-09 01:22:27,017 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-12-09 01:22:27,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 01:22:27,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-12-09 01:22:27,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-12-09 01:22:27,052 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 01:22:27,053 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 01:22:27,053 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 01:22:27,053 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 01:22:27,053 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 01:22:27,053 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 01:22:27,053 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 01:22:27,053 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 01:22:27,053 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 01:22:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states. [2018-12-09 01:22:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:22:27,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:27,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:27,070 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:27,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1814732104, now seen corresponding path program 1 times [2018-12-09 01:22:27,076 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:27,076 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:27,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:27,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:27,164 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 6 treesize of output 5 [2018-12-09 01:22:27,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:22:27,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:27,178 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:22:27,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:22:27,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:22:27,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:22:27,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:22:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:22:27,192 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 3 states. [2018-12-09 01:22:27,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:27,293 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-12-09 01:22:27,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:22:27,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 01:22:27,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:27,301 INFO L225 Difference]: With dead ends: 83 [2018-12-09 01:22:27,301 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 01:22:27,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:22:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 01:22:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-12-09 01:22:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 01:22:27,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-12-09 01:22:27,325 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 11 [2018-12-09 01:22:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:27,325 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-12-09 01:22:27,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:22:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-12-09 01:22:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 01:22:27,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:27,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:27,326 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:27,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:27,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1814732105, now seen corresponding path program 1 times [2018-12-09 01:22:27,326 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:27,326 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:27,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:27,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:27,372 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 6 treesize of output 5 [2018-12-09 01:22:27,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:22:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:27,390 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:22:27,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:22:27,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 01:22:27,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:22:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:22:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:22:27,393 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 3 states. [2018-12-09 01:22:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:27,472 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-12-09 01:22:27,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:22:27,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 01:22:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:27,474 INFO L225 Difference]: With dead ends: 73 [2018-12-09 01:22:27,474 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 01:22:27,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:22:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 01:22:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-09 01:22:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 01:22:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-12-09 01:22:27,479 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 11 [2018-12-09 01:22:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:27,480 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-12-09 01:22:27,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:22:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-12-09 01:22:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 01:22:27,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:27,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:27,481 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:27,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash -272916596, now seen corresponding path program 1 times [2018-12-09 01:22:27,481 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:27,482 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:27,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:27,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:27,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:22:27,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:22:27,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 01:22:27,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 01:22:27,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 01:22:27,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:22:27,536 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 3 states. [2018-12-09 01:22:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:27,565 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-12-09 01:22:27,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 01:22:27,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 01:22:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:27,567 INFO L225 Difference]: With dead ends: 79 [2018-12-09 01:22:27,568 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 01:22:27,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 01:22:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 01:22:27,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-09 01:22:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 01:22:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-09 01:22:27,572 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 15 [2018-12-09 01:22:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:27,572 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-09 01:22:27,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 01:22:27,572 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-09 01:22:27,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 01:22:27,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:27,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:27,573 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:27,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:27,573 INFO L82 PathProgramCache]: Analyzing trace with hash -694338034, now seen corresponding path program 1 times [2018-12-09 01:22:27,573 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:27,574 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:27,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:27,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:27,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:22:27,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:22:27,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 01:22:27,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 01:22:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 01:22:27,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:22:27,635 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2018-12-09 01:22:27,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:27,672 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-12-09 01:22:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:22:27,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 01:22:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:27,674 INFO L225 Difference]: With dead ends: 79 [2018-12-09 01:22:27,674 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 01:22:27,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:22:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 01:22:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-12-09 01:22:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 01:22:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-12-09 01:22:27,679 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 18 [2018-12-09 01:22:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:27,680 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-12-09 01:22:27,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 01:22:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-12-09 01:22:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:22:27,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:27,681 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:27,681 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:27,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:27,681 INFO L82 PathProgramCache]: Analyzing trace with hash -589776010, now seen corresponding path program 1 times [2018-12-09 01:22:27,682 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:27,682 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:27,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:27,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:27,776 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 6 treesize of output 5 [2018-12-09 01:22:27,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:22:27,790 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 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 01:22:27,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:27,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-09 01:22:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:27,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:27,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:27,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:27,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:27,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:27,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:27,852 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 6 treesize of output 5 [2018-12-09 01:22:27,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:22:27,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:27,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:27,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 01:22:27,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:27,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:27,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:16 [2018-12-09 01:22:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:27,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:27,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:22:27,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4, 4] total 6 [2018-12-09 01:22:27,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 01:22:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 01:22:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 01:22:27,959 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 7 states. [2018-12-09 01:22:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:28,196 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-12-09 01:22:28,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:22:28,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-09 01:22:28,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:28,197 INFO L225 Difference]: With dead ends: 79 [2018-12-09 01:22:28,197 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 01:22:28,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:22:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 01:22:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2018-12-09 01:22:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:22:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-12-09 01:22:28,201 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 22 [2018-12-09 01:22:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:28,201 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-12-09 01:22:28,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 01:22:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-12-09 01:22:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 01:22:28,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:28,202 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:28,202 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:28,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash -589776009, now seen corresponding path program 1 times [2018-12-09 01:22:28,202 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:28,202 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:28,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:28,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:28,296 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 6 treesize of output 5 [2018-12-09 01:22:28,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,306 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 6 treesize of output 5 [2018-12-09 01:22:28,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:22:28,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:28,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:28,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:22:28,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,344 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 14 treesize of output 17 [2018-12-09 01:22:28,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:28,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-09 01:22:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:28,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:28,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:28,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/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-09 01:22:28,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:28,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:28,597 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 6 treesize of output 5 [2018-12-09 01:22:28,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,605 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 6 treesize of output 5 [2018-12-09 01:22:28,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:22:28,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:28,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-09 01:22:28,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:28,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:28,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:22:28,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:28,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:28,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-09 01:22:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:28,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:28,825 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-12-09 01:22:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:28,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:22:28,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 5] total 8 [2018-12-09 01:22:28,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:22:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:22:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:22:28,849 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 9 states. [2018-12-09 01:22:29,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:29,348 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2018-12-09 01:22:29,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 01:22:29,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-09 01:22:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:29,350 INFO L225 Difference]: With dead ends: 78 [2018-12-09 01:22:29,350 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 01:22:29,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:22:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 01:22:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-12-09 01:22:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-09 01:22:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-12-09 01:22:29,354 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 22 [2018-12-09 01:22:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:29,355 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-12-09 01:22:29,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:22:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-12-09 01:22:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 01:22:29,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:29,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:29,356 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:29,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash 84976100, now seen corresponding path program 1 times [2018-12-09 01:22:29,357 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:29,357 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:29,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:29,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:29,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:29,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:29,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:29,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:29,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:29,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:29,577 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 6 treesize of output 5 [2018-12-09 01:22:29,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:29,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:29,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:22:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:29,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:22:29,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:22:29,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 6] total 16 [2018-12-09 01:22:29,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 01:22:29,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 01:22:29,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:22:29,716 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 16 states. [2018-12-09 01:22:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:30,950 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-12-09 01:22:30,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 01:22:30,951 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-12-09 01:22:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:30,951 INFO L225 Difference]: With dead ends: 90 [2018-12-09 01:22:30,951 INFO L226 Difference]: Without dead ends: 87 [2018-12-09 01:22:30,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-12-09 01:22:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-09 01:22:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-12-09 01:22:30,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 01:22:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-12-09 01:22:30,956 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 25 [2018-12-09 01:22:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:30,956 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-12-09 01:22:30,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 01:22:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-12-09 01:22:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 01:22:30,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:30,957 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:30,957 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:30,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:30,958 INFO L82 PathProgramCache]: Analyzing trace with hash 701718863, now seen corresponding path program 1 times [2018-12-09 01:22:30,958 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:30,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:30,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:31,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:31,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:31,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:31,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:31,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:31,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:31,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:31,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:31,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:22:31,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 4 [2018-12-09 01:22:31,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 01:22:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 01:22:31,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 01:22:31,082 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 4 states. [2018-12-09 01:22:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:31,148 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-12-09 01:22:31,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 01:22:31,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-09 01:22:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:31,149 INFO L225 Difference]: With dead ends: 78 [2018-12-09 01:22:31,149 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 01:22:31,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 01:22:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 01:22:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-09 01:22:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 01:22:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-12-09 01:22:31,152 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 32 [2018-12-09 01:22:31,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:31,153 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-12-09 01:22:31,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 01:22:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-12-09 01:22:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 01:22:31,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:31,153 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:31,154 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:31,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:31,154 INFO L82 PathProgramCache]: Analyzing trace with hash -649114503, now seen corresponding path program 1 times [2018-12-09 01:22:31,154 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:31,154 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:31,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:31,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:22:31,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:22:31,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:22:31,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 01:22:31,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 01:22:31,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 01:22:31,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 01:22:31,266 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 6 states. [2018-12-09 01:22:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:31,308 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-12-09 01:22:31,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 01:22:31,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-12-09 01:22:31,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:31,309 INFO L225 Difference]: With dead ends: 81 [2018-12-09 01:22:31,309 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 01:22:31,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 01:22:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 01:22:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-12-09 01:22:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:22:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2018-12-09 01:22:31,312 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 33 [2018-12-09 01:22:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:31,312 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2018-12-09 01:22:31,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 01:22:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2018-12-09 01:22:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 01:22:31,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:31,312 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:31,313 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:31,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:31,313 INFO L82 PathProgramCache]: Analyzing trace with hash -649114448, now seen corresponding path program 1 times [2018-12-09 01:22:31,313 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:31,313 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:31,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:31,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:31,409 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 6 treesize of output 5 [2018-12-09 01:22:31,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:31,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:31,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:22:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 01:22:31,478 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:22:31,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:22:31,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 01:22:31,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:22:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:22:31,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:22:31,480 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand 9 states. [2018-12-09 01:22:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:31,984 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-12-09 01:22:31,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:22:31,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-09 01:22:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:31,984 INFO L225 Difference]: With dead ends: 78 [2018-12-09 01:22:31,985 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 01:22:31,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:22:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 01:22:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-12-09 01:22:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:22:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-12-09 01:22:31,987 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 33 [2018-12-09 01:22:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:31,987 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-12-09 01:22:31,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:22:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-12-09 01:22:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 01:22:31,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:31,988 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:31,989 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:31,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:31,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1825800630, now seen corresponding path program 1 times [2018-12-09 01:22:31,989 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:31,989 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:32,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:32,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:32,100 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 6 treesize of output 5 [2018-12-09 01:22:32,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:22:32,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:32,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:32,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-09 01:22:32,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:19 [2018-12-09 01:22:32,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:32,137 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:22:32,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-12-09 01:22:32,172 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 23 treesize of output 18 [2018-12-09 01:22:32,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:32,176 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 18 treesize of output 27 [2018-12-09 01:22:32,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-12-09 01:22:32,257 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2018-12-09 01:22:32,263 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 16 treesize of output 15 [2018-12-09 01:22:32,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,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-09 01:22:32,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:55 [2018-12-09 01:22:32,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-12-09 01:22:32,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2018-12-09 01:22:32,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:22:32,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:32,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:32,708 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:16 [2018-12-09 01:22:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:32,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:33,495 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-09 01:22:34,219 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-12-09 01:22:34,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:22:34,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,275 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 24 treesize of output 20 [2018-12-09 01:22:34,278 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 20 treesize of output 7 [2018-12-09 01:22:34,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:43, output treesize:7 [2018-12-09 01:22:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:34,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:34,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:34,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:34,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:34,460 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 6 treesize of output 5 [2018-12-09 01:22:34,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:22:34,580 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:34,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:34,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:22:34,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-09 01:22:34,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:34,665 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:22:34,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2018-12-09 01:22:34,734 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 23 treesize of output 18 [2018-12-09 01:22:34,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:34,738 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 18 treesize of output 27 [2018-12-09 01:22:34,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:26 [2018-12-09 01:22:34,823 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-12-09 01:22:34,826 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 16 treesize of output 15 [2018-12-09 01:22:34,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:34,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:34,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2018-12-09 01:22:35,495 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 47 treesize of output 33 [2018-12-09 01:22:35,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-12-09 01:22:35,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:35,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:22:35,509 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:35,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:35,515 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-09 01:22:35,516 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:47, output treesize:7 [2018-12-09 01:22:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:35,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:35,916 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-09 01:22:36,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-12-09 01:22:36,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:36,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:36,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-12-09 01:22:36,398 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:36,398 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:62, output treesize:1 [2018-12-09 01:22:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:22:36,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:22:36,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16, 12] total 40 [2018-12-09 01:22:36,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-09 01:22:36,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-09 01:22:36,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 01:22:36,417 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 41 states. [2018-12-09 01:22:38,213 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-12-09 01:22:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:22:40,324 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2018-12-09 01:22:40,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 01:22:40,324 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 36 [2018-12-09 01:22:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:22:40,325 INFO L225 Difference]: With dead ends: 91 [2018-12-09 01:22:40,325 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 01:22:40,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 98 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=353, Invalid=2509, Unknown=0, NotChecked=0, Total=2862 [2018-12-09 01:22:40,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 01:22:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-12-09 01:22:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 01:22:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2018-12-09 01:22:40,329 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 36 [2018-12-09 01:22:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:22:40,329 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2018-12-09 01:22:40,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-09 01:22:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2018-12-09 01:22:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 01:22:40,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:22:40,330 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:22:40,330 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:22:40,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:22:40,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1825800629, now seen corresponding path program 1 times [2018-12-09 01:22:40,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:22:40,331 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:22:40,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:40,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:40,494 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 6 treesize of output 5 [2018-12-09 01:22:40,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,503 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 6 treesize of output 5 [2018-12-09 01:22:40,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:22:40,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:40,528 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 14 treesize of output 17 [2018-12-09 01:22:40,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:40,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:40,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:22:40,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-09 01:22:40,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:40,579 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:22:40,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:40,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:22:40,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-12-09 01:22:40,658 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 23 treesize of output 18 [2018-12-09 01:22:40,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:40,665 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 18 treesize of output 27 [2018-12-09 01:22:40,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,706 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 23 treesize of output 18 [2018-12-09 01:22:40,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:40,710 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:40,711 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 18 treesize of output 36 [2018-12-09 01:22:40,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-12-09 01:22:40,792 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2018-12-09 01:22:40,796 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 14 treesize of output 13 [2018-12-09 01:22:40,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,854 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 42 treesize of output 43 [2018-12-09 01:22:40,856 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 14 treesize of output 13 [2018-12-09 01:22:40,856 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:40,886 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:83 [2018-12-09 01:22:41,258 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 29 [2018-12-09 01:22:41,261 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 01:22:41,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:41,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:41,282 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 43 treesize of output 29 [2018-12-09 01:22:41,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-12-09 01:22:41,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:41,292 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 5 treesize of output 1 [2018-12-09 01:22:41,292 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:41,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:41,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:41,302 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:82, output treesize:20 [2018-12-09 01:22:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:41,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:42,846 WARN L180 SmtUtils]: Spent 831.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-12-09 01:22:43,189 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 01:22:43,554 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 01:22:43,926 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 01:22:45,023 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 49 [2018-12-09 01:22:45,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:22:45,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-09 01:22:45,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 01:22:45,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,152 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 28 treesize of output 22 [2018-12-09 01:22:45,156 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 5 [2018-12-09 01:22:45,156 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,161 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 01:22:45,352 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-09 01:22:45,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:22:45,386 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-09 01:22:45,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 01:22:45,412 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,417 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,419 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 20 treesize of output 16 [2018-12-09 01:22:45,421 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 16 treesize of output 3 [2018-12-09 01:22:45,422 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,423 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,440 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 01:22:45,570 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-12-09 01:22:45,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:22:45,643 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,708 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 60 treesize of output 56 [2018-12-09 01:22:45,713 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 56 treesize of output 43 [2018-12-09 01:22:45,713 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,720 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-12-09 01:22:45,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 01:22:45,726 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,738 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:45,794 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 01:22:45,976 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-12-09 01:22:46,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:22:46,057 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:46,071 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 24 treesize of output 20 [2018-12-09 01:22:46,074 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 20 treesize of output 7 [2018-12-09 01:22:46,074 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:46,077 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:46,081 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:46,086 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-12-09 01:22:46,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:22:46,128 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:46,147 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 10 treesize of output 8 [2018-12-09 01:22:46,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-09 01:22:46,150 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:46,152 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:46,162 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:46,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-12-09 01:22:46,217 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 4 variables, input treesize:196, output treesize:73 [2018-12-09 01:22:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:48,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:22:48,866 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:22:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:22:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:22:48,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:22:48,904 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 6 treesize of output 5 [2018-12-09 01:22:48,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:48,912 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 6 treesize of output 5 [2018-12-09 01:22:48,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:48,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:48,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:22:48,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:48,931 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 14 treesize of output 17 [2018-12-09 01:22:48,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:48,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:48,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:48,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:22:48,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:48,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:48,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-09 01:22:48,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:48,975 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:22:48,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:48,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:22:49,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:22:49,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,024 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2018-12-09 01:22:49,037 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 23 treesize of output 18 [2018-12-09 01:22:49,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:49,045 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 18 treesize of output 27 [2018-12-09 01:22:49,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,090 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 23 treesize of output 18 [2018-12-09 01:22:49,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:22:49,094 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:49,094 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 18 treesize of output 36 [2018-12-09 01:22:49,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:59 [2018-12-09 01:22:49,140 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 84 [2018-12-09 01:22:49,144 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 14 treesize of output 13 [2018-12-09 01:22:49,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,202 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 42 treesize of output 43 [2018-12-09 01:22:49,205 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 14 treesize of output 13 [2018-12-09 01:22:49,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:85 [2018-12-09 01:22:49,339 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 29 [2018-12-09 01:22:49,342 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 01:22:49,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,363 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 43 treesize of output 29 [2018-12-09 01:22:49,365 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 5 treesize of output 1 [2018-12-09 01:22:49,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-12-09 01:22:49,375 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:49,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:22:49,385 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:82, output treesize:20 [2018-12-09 01:22:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:22:49,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:22:51,542 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2018-12-09 01:22:51,996 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-12-09 01:22:52,339 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 01:22:52,652 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-09 01:22:55,290 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2018-12-09 01:22:55,304 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 90 [2018-12-09 01:22:55,426 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2018-12-09 01:22:55,431 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 16 treesize of output 20 [2018-12-09 01:22:55,438 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,438 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 37 [2018-12-09 01:22:55,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,491 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 38 treesize of output 30 [2018-12-09 01:22:55,497 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,497 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-12-09 01:22:55,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,718 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-12-09 01:22:55,817 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 39 treesize of output 37 [2018-12-09 01:22:55,821 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,822 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 51 [2018-12-09 01:22:55,823 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,840 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-12-09 01:22:55,848 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,848 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 37 [2018-12-09 01:22:55,849 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,863 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,914 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 44 treesize of output 36 [2018-12-09 01:22:55,953 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,954 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-12-09 01:22:55,954 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,967 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:22:55,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-12-09 01:22:55,973 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,974 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:55,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-12-09 01:22:55,975 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:55,985 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:56,019 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:22:56,242 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 109 [2018-12-09 01:22:56,909 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-12-09 01:22:56,937 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 16 treesize of output 20 [2018-12-09 01:22:56,965 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:56,970 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 20 treesize of output 28 [2018-12-09 01:22:56,970 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:57,049 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:57,149 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 75 treesize of output 69 [2018-12-09 01:22:57,176 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:57,179 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-12-09 01:22:57,179 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:57,215 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:57,315 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:57,507 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2018-12-09 01:22:57,785 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-12-09 01:22:57,820 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 43 treesize of output 41 [2018-12-09 01:22:57,825 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:57,826 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:57,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 55 [2018-12-09 01:22:57,827 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:57,876 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:57,924 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 39 treesize of output 33 [2018-12-09 01:22:57,957 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:57,958 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:22:57,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-12-09 01:22:57,959 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:57,981 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 01:22:57,981 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 01:22:58,016 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:58,037 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:22:58,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-09 01:22:58,126 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 4 variables, input treesize:309, output treesize:132 [2018-12-09 01:22:58,741 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-12-09 01:22:59,730 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-09 01:23:00,082 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-09 01:23:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 01:23:00,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:23:00,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15, 19] total 37 [2018-12-09 01:23:00,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-09 01:23:00,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-09 01:23:00,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1240, Unknown=1, NotChecked=0, Total=1406 [2018-12-09 01:23:00,377 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 38 states. [2018-12-09 01:23:01,207 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-09 01:23:01,630 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-09 01:23:02,418 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-12-09 01:24:12,195 WARN L180 SmtUtils]: Spent 1.16 m on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2018-12-09 01:24:13,921 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-12-09 01:24:15,291 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-09 01:24:15,994 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-12-09 01:24:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:24:18,094 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2018-12-09 01:24:18,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 01:24:18,095 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 36 [2018-12-09 01:24:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:24:18,097 INFO L225 Difference]: With dead ends: 120 [2018-12-09 01:24:18,097 INFO L226 Difference]: Without dead ends: 120 [2018-12-09 01:24:18,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 81.4s TimeCoverageRelationStatistics Valid=528, Invalid=2551, Unknown=1, NotChecked=0, Total=3080 [2018-12-09 01:24:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-09 01:24:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2018-12-09 01:24:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-09 01:24:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2018-12-09 01:24:18,102 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 36 [2018-12-09 01:24:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:24:18,102 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2018-12-09 01:24:18,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-09 01:24:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2018-12-09 01:24:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 01:24:18,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:24:18,103 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:24:18,103 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:24:18,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:24:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash -959110344, now seen corresponding path program 2 times [2018-12-09 01:24:18,103 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:24:18,103 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:24:18,117 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 01:24:18,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:24:18,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:24:18,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:24:18,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:24:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:24:18,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:24:18,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:24:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:24:18,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:24:18,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:24:18,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:24:18,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:24:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 01:24:18,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:24:18,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 9] total 19 [2018-12-09 01:24:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 01:24:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 01:24:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:24:18,630 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand 19 states. [2018-12-09 01:24:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:24:19,560 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2018-12-09 01:24:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-09 01:24:19,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-12-09 01:24:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:24:19,560 INFO L225 Difference]: With dead ends: 130 [2018-12-09 01:24:19,561 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 01:24:19,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=933, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 01:24:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 01:24:19,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2018-12-09 01:24:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-09 01:24:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2018-12-09 01:24:19,564 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 39 [2018-12-09 01:24:19,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:24:19,564 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2018-12-09 01:24:19,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 01:24:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2018-12-09 01:24:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 01:24:19,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:24:19,565 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:24:19,565 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:24:19,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:24:19,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1818957814, now seen corresponding path program 1 times [2018-12-09 01:24:19,565 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:24:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:24:19,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 01:24:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:24:19,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:24:19,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:24:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:24:19,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:24:19,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:24:19,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:24:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:24:19,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 01:24:19,838 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:24:19,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:24:19,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 5] total 16 [2018-12-09 01:24:19,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 01:24:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 01:24:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-12-09 01:24:19,853 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 16 states. [2018-12-09 01:24:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:24:20,772 INFO L93 Difference]: Finished difference Result 130 states and 152 transitions. [2018-12-09 01:24:20,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 01:24:20,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-12-09 01:24:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:24:20,773 INFO L225 Difference]: With dead ends: 130 [2018-12-09 01:24:20,773 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 01:24:20,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2018-12-09 01:24:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 01:24:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2018-12-09 01:24:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 01:24:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 144 transitions. [2018-12-09 01:24:20,778 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 144 transitions. Word has length 46 [2018-12-09 01:24:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:24:20,778 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 144 transitions. [2018-12-09 01:24:20,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 01:24:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 144 transitions. [2018-12-09 01:24:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 01:24:20,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:24:20,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:24:20,779 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:24:20,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:24:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash -546426460, now seen corresponding path program 1 times [2018-12-09 01:24:20,779 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:24:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:24:20,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:24:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:24:20,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:24:20,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:24:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:24:20,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:24:20,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:24:20,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:24:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:24:21,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:24:21,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:24:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 01:24:21,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:24:21,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 9] total 19 [2018-12-09 01:24:21,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 01:24:21,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 01:24:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:24:21,311 INFO L87 Difference]: Start difference. First operand 120 states and 144 transitions. Second operand 19 states. [2018-12-09 01:24:21,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:24:21,482 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-12-09 01:24:21,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:24:21,483 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-12-09 01:24:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:24:21,483 INFO L225 Difference]: With dead ends: 81 [2018-12-09 01:24:21,483 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 01:24:21,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-12-09 01:24:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 01:24:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-12-09 01:24:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 01:24:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-12-09 01:24:21,485 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 47 [2018-12-09 01:24:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:24:21,485 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-09 01:24:21,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 01:24:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-12-09 01:24:21,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 01:24:21,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:24:21,486 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:24:21,486 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:24:21,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:24:21,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1884227615, now seen corresponding path program 1 times [2018-12-09 01:24:21,486 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:24:21,486 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:24:21,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:24:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:24:21,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:21,637 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 6 treesize of output 5 [2018-12-09 01:24:21,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:21,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:21,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:24:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 01:24:21,743 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:24:21,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:24:21,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:24:21,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 01:24:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 01:24:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-09 01:24:21,746 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 10 states. [2018-12-09 01:24:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:24:22,218 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-12-09 01:24:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 01:24:22,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-12-09 01:24:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:24:22,219 INFO L225 Difference]: With dead ends: 72 [2018-12-09 01:24:22,219 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 01:24:22,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 01:24:22,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 01:24:22,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-12-09 01:24:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 01:24:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-12-09 01:24:22,222 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 54 [2018-12-09 01:24:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:24:22,222 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-12-09 01:24:22,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 01:24:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-12-09 01:24:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 01:24:22,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:24:22,223 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:24:22,223 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:24:22,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:24:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2095869278, now seen corresponding path program 1 times [2018-12-09 01:24:22,223 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:24:22,223 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:24:22,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:24:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:24:22,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 01:24:22,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 01:24:22,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 01:24:22,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 01:24:22,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 01:24:22,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 01:24:22,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 01:24:22,316 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 9 states. [2018-12-09 01:24:22,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:24:22,612 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-09 01:24:22,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:24:22,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-12-09 01:24:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:24:22,613 INFO L225 Difference]: With dead ends: 72 [2018-12-09 01:24:22,613 INFO L226 Difference]: Without dead ends: 70 [2018-12-09 01:24:22,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-09 01:24:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-09 01:24:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-12-09 01:24:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 01:24:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-09 01:24:22,614 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 57 [2018-12-09 01:24:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:24:22,615 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-09 01:24:22,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 01:24:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-09 01:24:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:24:22,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:24:22,615 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:24:22,615 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:24:22,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:24:22,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1189511465, now seen corresponding path program 1 times [2018-12-09 01:24:22,615 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:24:22,616 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:24:22,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:24:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:24:22,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:24:22,865 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 6 treesize of output 5 [2018-12-09 01:24:22,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:24:22,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:24:22,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:24:22,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:24:22,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-09 01:24:22,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:24:22,895 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:24:22,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-12-09 01:24:22,924 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 23 treesize of output 18 [2018-12-09 01:24:22,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:24:22,928 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 18 treesize of output 27 [2018-12-09 01:24:22,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-12-09 01:24:22,975 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2018-12-09 01:24:22,978 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 16 treesize of output 15 [2018-12-09 01:24:22,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:22,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:23,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:23,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2018-12-09 01:24:23,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-12-09 01:24:23,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 01:24:23,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:23,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:24:23,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:23,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:23,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:23,279 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:11 [2018-12-09 01:24:39,657 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 01:24:39,663 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:24:39,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 82 [2018-12-09 01:24:39,705 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 30 treesize of output 41 [2018-12-09 01:24:39,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:24:39,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:24:39,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 01:24:39,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:88 [2018-12-09 01:24:41,886 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 27 treesize of output 21 [2018-12-09 01:24:41,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 01:24:41,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:41,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:41,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:41,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-12-09 01:24:44,018 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 44 treesize of output 35 [2018-12-09 01:24:44,021 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:24:44,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:24:44,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:24:44,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2018-12-09 01:24:44,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:44,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:44,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:44,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-12-09 01:24:50,262 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 34 treesize of output 26 [2018-12-09 01:24:50,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-12-09 01:24:50,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:50,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:50,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:24:50,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:12 [2018-12-09 01:24:54,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:24:54,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 01:24:54,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:24:54,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:24:54,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-09 01:24:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:24:56,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:25:09,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:09,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:09,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:09,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:09,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:09,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:30 [2018-12-09 01:25:11,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:11,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:11,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:11,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:11,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:11,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:88 [2018-12-09 01:25:11,732 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:11,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:11,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:11,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:11,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:11,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:64 [2018-12-09 01:25:13,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:13,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:13,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:14,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:14,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:14,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:102, output treesize:88 [2018-12-09 01:25:14,909 WARN L180 SmtUtils]: Spent 731.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 01:25:16,555 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-09 01:25:18,578 WARN L180 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 44 [2018-12-09 01:25:21,162 WARN L180 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-09 01:25:21,264 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-09 01:25:27,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-12-09 01:25:27,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:27,844 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 27 treesize of output 20 [2018-12-09 01:25:27,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:27,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:27,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 [2018-12-09 01:25:28,322 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-12-09 01:25:28,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-09 01:25:28,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:28,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 01:25:28,376 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 17 treesize of output 4 [2018-12-09 01:25:28,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:28,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:28,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:28,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:28,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:80, output treesize:4 [2018-12-09 01:25:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:25:28,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:25:28,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:25:28,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:25:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:25:28,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:25:28,516 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 6 treesize of output 5 [2018-12-09 01:25:28,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:28,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:28,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 01:25:34,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:25:34,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:25:34,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:25:34,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-09 01:25:34,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:25:34,758 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:25:34,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:17 [2018-12-09 01:25:34,773 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 23 treesize of output 18 [2018-12-09 01:25:34,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:25:34,777 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 18 treesize of output 27 [2018-12-09 01:25:34,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:26 [2018-12-09 01:25:34,808 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-09 01:25:34,811 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 16 treesize of output 15 [2018-12-09 01:25:34,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:34,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:34,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-12-09 01:25:35,004 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-12-09 01:25:35,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:25:35,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:35,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 01:25:35,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:35,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:35,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:35,024 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:11 [2018-12-09 01:25:35,064 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:25:35,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 74 [2018-12-09 01:25:35,108 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 32 treesize of output 21 [2018-12-09 01:25:35,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:25:35,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:25:35,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:35,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:86 [2018-12-09 01:25:37,251 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 27 treesize of output 21 [2018-12-09 01:25:37,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 01:25:37,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:37,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:37,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:37,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-12-09 01:25:37,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 44 treesize of output 35 [2018-12-09 01:25:37,314 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:25:37,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:25:37,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:25:37,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 44 [2018-12-09 01:25:37,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:37,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:37,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:37,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-12-09 01:25:41,482 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 34 treesize of output 26 [2018-12-09 01:25:41,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-12-09 01:25:41,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:41,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:41,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:25:41,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:12 [2018-12-09 01:25:41,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:25:41,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-09 01:25:41,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:41,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:41,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-12-09 01:25:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:25:43,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:25:47,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:47,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:47,778 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:47,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:47,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:47,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:30 [2018-12-09 01:25:49,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:49,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:49,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:49,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:50,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:50,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:102, output treesize:86 [2018-12-09 01:25:50,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:50,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:50,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:50,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:50,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:50,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:62 [2018-12-09 01:25:52,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:52,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:52,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:52,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:25:52,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:52,605 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:102, output treesize:86 [2018-12-09 01:25:53,419 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-12-09 01:25:53,606 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 01:25:53,726 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 01:25:53,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-12-09 01:25:53,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:53,760 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 27 treesize of output 20 [2018-12-09 01:25:53,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:53,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:25:53,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:40 [2018-12-09 01:25:54,664 WARN L180 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 01:25:54,716 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-09 01:25:54,716 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:126, output treesize:17 [2018-12-09 01:25:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 01:25:55,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:25:55,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 24, 25] total 45 [2018-12-09 01:25:55,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-09 01:25:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-09 01:25:55,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1891, Unknown=18, NotChecked=0, Total=2070 [2018-12-09 01:25:55,301 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 46 states. [2018-12-09 01:26:13,979 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-09 01:26:28,036 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-12-09 01:26:40,783 WARN L180 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2018-12-09 01:26:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:26:44,701 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2018-12-09 01:26:44,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 01:26:44,701 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 59 [2018-12-09 01:26:44,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:26:44,702 INFO L225 Difference]: With dead ends: 86 [2018-12-09 01:26:44,702 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 01:26:44,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 156 SyntacticMatches, 34 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 130.1s TimeCoverageRelationStatistics Valid=466, Invalid=3937, Unknown=19, NotChecked=0, Total=4422 [2018-12-09 01:26:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 01:26:44,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-12-09 01:26:44,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-09 01:26:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-12-09 01:26:44,704 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 59 [2018-12-09 01:26:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:26:44,704 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-12-09 01:26:44,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-09 01:26:44,704 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-12-09 01:26:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 01:26:44,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:26:44,705 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:26:44,705 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:26:44,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:26:44,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1189511466, now seen corresponding path program 1 times [2018-12-09 01:26:44,705 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:26:44,705 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:26:44,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:45,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:45,041 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 6 treesize of output 5 [2018-12-09 01:26:45,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,048 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 6 treesize of output 5 [2018-12-09 01:26:45,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:26:45,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:45,072 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 14 treesize of output 17 [2018-12-09 01:26:45,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:45,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:45,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:26:45,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-09 01:26:45,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:26:45,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:26:45,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:26:45,148 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:26:45,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-12-09 01:26:45,199 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 23 treesize of output 18 [2018-12-09 01:26:45,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:45,204 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:26:45,205 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 18 treesize of output 36 [2018-12-09 01:26:45,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,249 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 23 treesize of output 18 [2018-12-09 01:26:45,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:45,253 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 18 treesize of output 27 [2018-12-09 01:26:45,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-12-09 01:26:45,338 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 42 treesize of output 43 [2018-12-09 01:26:45,342 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 14 treesize of output 13 [2018-12-09 01:26:45,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,398 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-12-09 01:26:45,401 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 14 treesize of output 13 [2018-12-09 01:26:45,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,444 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:85 [2018-12-09 01:26:45,720 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-12-09 01:26:45,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-09 01:26:45,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:45,734 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 5 treesize of output 1 [2018-12-09 01:26:45,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:45,759 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 22 treesize of output 20 [2018-12-09 01:26:45,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:45,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:45,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:21 [2018-12-09 01:26:46,204 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:26:46,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 138 [2018-12-09 01:26:46,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:46,252 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 42 treesize of output 24 [2018-12-09 01:26:46,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,346 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:26:46,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 77 [2018-12-09 01:26:46,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:46,378 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 42 treesize of output 24 [2018-12-09 01:26:46,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:46,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:173, output treesize:87 [2018-12-09 01:26:46,485 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-12-09 01:26:46,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-09 01:26:46,489 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:46,499 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 5 treesize of output 1 [2018-12-09 01:26:46,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:46,523 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 22 treesize of output 20 [2018-12-09 01:26:46,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:46,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:21 [2018-12-09 01:26:46,740 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 41 treesize of output 42 [2018-12-09 01:26:46,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:46,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:46,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 01:26:46,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,875 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-09 01:26:46,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:46,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:46,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2018-12-09 01:26:46,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,902 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:46,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:46,931 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:85 [2018-12-09 01:26:47,157 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 29 [2018-12-09 01:26:47,160 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 01:26:47,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,182 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 43 treesize of output 29 [2018-12-09 01:26:47,184 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 5 treesize of output 1 [2018-12-09 01:26:47,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-12-09 01:26:47,194 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:47,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:47,205 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2018-12-09 01:26:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 01:26:47,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:26:48,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:48,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:48,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:48,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:48,714 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:48,727 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:48,813 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:48,824 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:48,888 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:48,892 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:48,923 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:48,926 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:48,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 01:26:48,944 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:149, output treesize:65 [2018-12-09 01:26:49,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:49,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:49,848 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:49,899 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:50,238 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:50,283 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:50,636 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:50,684 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:50,927 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:50,964 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:51,209 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:51,240 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:51,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 01:26:51,421 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:305, output treesize:249 [2018-12-09 01:26:51,977 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2018-12-09 01:26:52,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:52,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:52,673 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:52,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:52,866 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:52,884 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:53,042 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:53,049 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:53,166 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,171 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,248 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:53,256 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:53,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 01:26:53,308 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:329, output treesize:180 [2018-12-09 01:26:53,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:26:53,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:26:53,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:26:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:26:53,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:26:53,854 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 6 treesize of output 5 [2018-12-09 01:26:53,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,862 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 6 treesize of output 5 [2018-12-09 01:26:53,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-09 01:26:53,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:53,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:53,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:26:53,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,892 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 14 treesize of output 17 [2018-12-09 01:26:53,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2018-12-09 01:26:53,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:26:53,918 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:26:53,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:26:53,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:26:53,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,952 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2018-12-09 01:26:53,977 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 23 treesize of output 18 [2018-12-09 01:26:53,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:53,983 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 18 treesize of output 27 [2018-12-09 01:26:53,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:53,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,028 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 23 treesize of output 18 [2018-12-09 01:26:54,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:54,031 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:26:54,032 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 18 treesize of output 36 [2018-12-09 01:26:54,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:72, output treesize:59 [2018-12-09 01:26:54,078 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-12-09 01:26:54,081 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 14 treesize of output 13 [2018-12-09 01:26:54,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,136 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 42 treesize of output 43 [2018-12-09 01:26:54,138 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 14 treesize of output 13 [2018-12-09 01:26:54,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:83 [2018-12-09 01:26:54,240 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 26 treesize of output 24 [2018-12-09 01:26:54,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,258 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-09 01:26:54,261 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 5 treesize of output 1 [2018-12-09 01:26:54,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-09 01:26:54,272 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:54,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:54,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:54,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:21 [2018-12-09 01:26:54,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:54,572 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:26:54,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 148 [2018-12-09 01:26:54,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:54,614 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 42 treesize of output 24 [2018-12-09 01:26:54,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,699 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:26:54,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 77 [2018-12-09 01:26:54,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:54,732 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 42 treesize of output 24 [2018-12-09 01:26:54,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:54,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:182, output treesize:89 [2018-12-09 01:26:54,836 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-12-09 01:26:54,838 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 5 treesize of output 1 [2018-12-09 01:26:54,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-09 01:26:54,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:54,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:54,871 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 22 treesize of output 20 [2018-12-09 01:26:54,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:54,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:54,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:21 [2018-12-09 01:26:54,953 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-12-09 01:26:54,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:54,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:54,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-12-09 01:26:54,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,079 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 41 treesize of output 42 [2018-12-09 01:26:55,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:55,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:26:55,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 01:26:55,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:55,129 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:83 [2018-12-09 01:26:55,183 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 29 [2018-12-09 01:26:55,187 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 01:26:55,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,208 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 43 treesize of output 29 [2018-12-09 01:26:55,210 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 5 treesize of output 1 [2018-12-09 01:26:55,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-12-09 01:26:55,221 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:55,232 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:80, output treesize:18 [2018-12-09 01:26:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 01:26:55,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:26:55,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:55,778 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:55,794 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:55,893 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:55,897 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:55,963 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:55,968 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:56,007 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:56,011 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:56,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 01:26:56,029 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:149, output treesize:65 [2018-12-09 01:26:56,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:56,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:56,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:56,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:56,885 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:56,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:57,254 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:57,296 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:57,561 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:57,614 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:57,821 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:57,865 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:58,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 01:26:58,055 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:305, output treesize:249 [2018-12-09 01:26:59,042 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:59,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:59,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:59,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:59,706 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 01:26:59,730 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:26:59,984 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:26:59,997 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:00,246 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:00,284 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:00,465 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:00,484 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:00,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-09 01:27:00,619 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:359, output treesize:213 [2018-12-09 01:27:01,036 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 01:27:01,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:27:01,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-12-09 01:27:01,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 01:27:01,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 01:27:01,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 01:27:01,053 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 24 states. [2018-12-09 01:27:03,761 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-09 01:27:06,318 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-12-09 01:27:06,617 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-09 01:27:06,907 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-09 01:27:07,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:27:07,662 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-12-09 01:27:07,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 01:27:07,662 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-12-09 01:27:07,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:27:07,663 INFO L225 Difference]: With dead ends: 81 [2018-12-09 01:27:07,663 INFO L226 Difference]: Without dead ends: 81 [2018-12-09 01:27:07,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 109 SyntacticMatches, 19 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=294, Invalid=2462, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 01:27:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-09 01:27:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-12-09 01:27:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:27:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-12-09 01:27:07,665 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 59 [2018-12-09 01:27:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:27:07,666 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-12-09 01:27:07,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 01:27:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-12-09 01:27:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 01:27:07,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:27:07,667 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:27:07,667 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:27:07,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:27:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1040493453, now seen corresponding path program 1 times [2018-12-09 01:27:07,667 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:27:07,667 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:27:07,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:27:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:27:07,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:27:07,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:27:07,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:07,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:07,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-12-09 01:27:07,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:07,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:07,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:27:07,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:07,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:07,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2018-12-09 01:27:07,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:27:07,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:07,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:07,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:07,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:07,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 01:27:07,989 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 23 treesize of output 18 [2018-12-09 01:27:07,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:07,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:07,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:27:07,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:08,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:08,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:08,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-12-09 01:27:08,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 55 treesize of output 49 [2018-12-09 01:27:08,052 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 16 treesize of output 15 [2018-12-09 01:27:08,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:08,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:08,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:08,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-12-09 01:27:10,544 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_update_at_~head.offset (_ BitVec 32))) (= |c_#memory_$Pointer$.base| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_update_at_#in~head.base|) (bvadd |c_dll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) dll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| .cse0) dll_update_at_~head.offset)))))) is different from true [2018-12-09 01:27:10,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 78 treesize of output 64 [2018-12-09 01:27:10,631 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 32 treesize of output 21 [2018-12-09 01:27:10,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:27:10,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:27:10,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:10,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-12-09 01:27:10,863 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 45 treesize of output 36 [2018-12-09 01:27:10,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:10,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:10,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-12-09 01:27:10,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:10,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:10,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:10,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2018-12-09 01:27:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-12-09 01:27:11,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:27:11,904 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:11,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:11,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:11,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:13 [2018-12-09 01:27:12,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:12,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:12,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:12,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-12-09 01:27:12,344 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:12,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:12,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:12,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-12-09 01:27:12,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:27:12,475 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:27:12,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 01:27:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 01:27:12,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:27:12,522 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 01:27:12,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-12-09 01:27:12,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:12,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:12,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:27:12,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2018-12-09 01:27:12,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:27:12,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:12,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:21 [2018-12-09 01:27:12,733 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 23 treesize of output 18 [2018-12-09 01:27:12,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:12,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:12,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:27:12,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:30 [2018-12-09 01:27:12,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 55 treesize of output 49 [2018-12-09 01:27:12,768 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 16 treesize of output 15 [2018-12-09 01:27:12,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:12,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:12,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-12-09 01:27:12,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 78 treesize of output 64 [2018-12-09 01:27:12,959 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 32 treesize of output 21 [2018-12-09 01:27:12,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:27:12,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:27:13,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:13,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:82 [2018-12-09 01:27:13,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-12-09 01:27:13,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:13,043 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:13,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 50 [2018-12-09 01:27:13,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:13,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:13,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:13,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2018-12-09 01:27:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-12-09 01:27:13,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:27:13,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:13 [2018-12-09 01:27:13,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:28 [2018-12-09 01:27:13,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:13,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:30 [2018-12-09 01:27:13,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:27:13,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 26 [2018-12-09 01:27:13,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 01:27:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 01:27:13,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1009, Unknown=1, NotChecked=64, Total=1190 [2018-12-09 01:27:13,740 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 26 states. [2018-12-09 01:27:15,233 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-12-09 01:27:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:27:17,623 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-12-09 01:27:17,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 01:27:17,623 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-12-09 01:27:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:27:17,624 INFO L225 Difference]: With dead ends: 81 [2018-12-09 01:27:17,624 INFO L226 Difference]: Without dead ends: 79 [2018-12-09 01:27:17,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 127 SyntacticMatches, 12 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=331, Invalid=2642, Unknown=1, NotChecked=106, Total=3080 [2018-12-09 01:27:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-09 01:27:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2018-12-09 01:27:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 01:27:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-09 01:27:17,626 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 62 [2018-12-09 01:27:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:27:17,626 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-09 01:27:17,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 01:27:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-09 01:27:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 01:27:17,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:27:17,626 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:27:17,626 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:27:17,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:27:17,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2082998530, now seen corresponding path program 2 times [2018-12-09 01:27:17,627 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:27:17,627 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:27:17,640 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 01:27:17,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:27:17,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:27:17,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:27:17,920 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 6 treesize of output 5 [2018-12-09 01:27:17,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:17,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:17,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-09 01:27:17,942 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 13 treesize of output 10 [2018-12-09 01:27:17,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:17,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:17,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:17,960 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 13 treesize of output 10 [2018-12-09 01:27:17,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:17,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:17,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:17,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:17,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-12-09 01:27:17,993 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 23 treesize of output 18 [2018-12-09 01:27:17,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:17,996 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 18 treesize of output 27 [2018-12-09 01:27:17,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,026 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 23 treesize of output 18 [2018-12-09 01:27:18,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:18,029 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 18 treesize of output 27 [2018-12-09 01:27:18,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-12-09 01:27:18,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:18,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:18,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:27:18,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:47 [2018-12-09 01:27:18,158 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 34 treesize of output 35 [2018-12-09 01:27:18,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 01:27:18,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,205 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 34 treesize of output 35 [2018-12-09 01:27:18,208 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 1 [2018-12-09 01:27:18,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:47 [2018-12-09 01:27:18,247 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 32 treesize of output 33 [2018-12-09 01:27:18,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:18,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,305 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 32 treesize of output 33 [2018-12-09 01:27:18,308 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:18,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,340 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:65 [2018-12-09 01:27:18,403 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 41 treesize of output 52 [2018-12-09 01:27:18,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:18,408 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:18,409 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 18 treesize of output 36 [2018-12-09 01:27:18,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,477 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 71 treesize of output 66 [2018-12-09 01:27:18,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:18,485 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 44 treesize of output 57 [2018-12-09 01:27:18,486 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:91, output treesize:95 [2018-12-09 01:27:18,609 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:18,610 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 68 treesize of output 58 [2018-12-09 01:27:18,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-12-09 01:27:18,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:18,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 95 treesize of output 82 [2018-12-09 01:27:18,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-12-09 01:27:18,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:18,729 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:97 [2018-12-09 01:27:19,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,438 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:19,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 127 [2018-12-09 01:27:19,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-12-09 01:27:19,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:19,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:19,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,607 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:19,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 141 [2018-12-09 01:27:19,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,693 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 92 [2018-12-09 01:27:19,694 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:19,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:19,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:19,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:171, output treesize:91 [2018-12-09 01:27:19,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-12-09 01:27:19,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:19,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:20,053 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 103 [2018-12-09 01:27:20,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:20,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:20,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:20,203 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 52 treesize of output 53 [2018-12-09 01:27:20,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:20,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:20,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 01:27:20,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:20,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:20,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:20,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:81 [2018-12-09 01:27:20,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:20,809 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 50 treesize of output 36 [2018-12-09 01:27:20,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 01:27:20,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:27:20,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:27:20,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:20,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:20,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2018-12-09 01:27:20,906 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 27 [2018-12-09 01:27:20,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:20,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 01:27:20,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-09 01:27:20,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:27:20,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:27:20,979 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:104, output treesize:37 [2018-12-09 01:27:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 01:27:21,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:27:22,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:22,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:22,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,534 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:22,538 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:22,567 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:22,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:22,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:22,583 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:93, output treesize:49 [2018-12-09 01:27:22,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:27:22,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:27:22,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:27:22,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:27:22,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:27:22,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:27:22,854 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 6 treesize of output 5 [2018-12-09 01:27:22,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-09 01:27:22,867 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 13 treesize of output 10 [2018-12-09 01:27:22,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:22,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,887 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 13 treesize of output 10 [2018-12-09 01:27:22,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:22,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:40, output treesize:27 [2018-12-09 01:27:22,906 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 23 treesize of output 18 [2018-12-09 01:27:22,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:22,909 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 18 treesize of output 27 [2018-12-09 01:27:22,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,939 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 23 treesize of output 18 [2018-12-09 01:27:22,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:22,942 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 18 treesize of output 27 [2018-12-09 01:27:22,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-12-09 01:27:22,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:22,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:22,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 01:27:22,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:22,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:47 [2018-12-09 01:27:22,999 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 34 treesize of output 35 [2018-12-09 01:27:23,003 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 1 [2018-12-09 01:27:23,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,048 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 34 treesize of output 35 [2018-12-09 01:27:23,051 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 1 [2018-12-09 01:27:23,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:47 [2018-12-09 01:27:23,091 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 32 treesize of output 33 [2018-12-09 01:27:23,094 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:23,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,144 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 32 treesize of output 45 [2018-12-09 01:27:23,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:23,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:77 [2018-12-09 01:27:23,226 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 41 treesize of output 52 [2018-12-09 01:27:23,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,231 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:23,231 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 18 treesize of output 36 [2018-12-09 01:27:23,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,309 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 71 treesize of output 66 [2018-12-09 01:27:23,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,314 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 44 treesize of output 57 [2018-12-09 01:27:23,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:95 [2018-12-09 01:27:23,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 118 treesize of output 105 [2018-12-09 01:27:23,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-12-09 01:27:23,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,486 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:23,487 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 68 treesize of output 58 [2018-12-09 01:27:23,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-12-09 01:27:23,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,533 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:97 [2018-12-09 01:27:23,547 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:23,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 182 [2018-12-09 01:27:23,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,659 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 92 [2018-12-09 01:27:23,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:23,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,790 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:23,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2018-12-09 01:27:23,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2018-12-09 01:27:23,835 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:23,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:171, output treesize:91 [2018-12-09 01:27:23,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 80 [2018-12-09 01:27:23,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:23,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:24,046 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 103 [2018-12-09 01:27:24,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:24,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:24,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:24,188 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 52 treesize of output 53 [2018-12-09 01:27:24,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:24,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:24,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-12-09 01:27:24,202 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:24,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:24,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:24,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:81 [2018-12-09 01:27:24,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:24,377 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 50 treesize of output 36 [2018-12-09 01:27:24,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 01:27:24,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:27:24,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:27:24,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:24,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:24,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 38 [2018-12-09 01:27:24,477 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 27 [2018-12-09 01:27:24,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:24,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-09 01:27:24,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-09 01:27:24,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:27:24,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 01:27:24,540 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:104, output treesize:37 [2018-12-09 01:27:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 01:27:24,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:27:24,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:24,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:24,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:24,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:24,837 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:24,841 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:24,868 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:24,871 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:24,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:24,883 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:93, output treesize:49 [2018-12-09 01:27:25,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:27:25,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-12-09 01:27:25,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 01:27:25,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 01:27:25,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1379, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 01:27:25,101 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 30 states. [2018-12-09 01:27:27,816 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-09 01:27:29,885 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-09 01:27:30,211 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-09 01:27:30,942 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-09 01:27:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:27:32,167 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-12-09 01:27:32,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 01:27:32,168 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-12-09 01:27:32,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:27:32,168 INFO L225 Difference]: With dead ends: 115 [2018-12-09 01:27:32,168 INFO L226 Difference]: Without dead ends: 115 [2018-12-09 01:27:32,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 121 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=284, Invalid=3256, Unknown=0, NotChecked=0, Total=3540 [2018-12-09 01:27:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-09 01:27:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2018-12-09 01:27:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-09 01:27:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2018-12-09 01:27:32,170 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 64 [2018-12-09 01:27:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:27:32,171 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2018-12-09 01:27:32,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 01:27:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-12-09 01:27:32,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 01:27:32,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:27:32,171 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:27:32,171 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:27:32,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:27:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash -923102594, now seen corresponding path program 2 times [2018-12-09 01:27:32,172 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:27:32,172 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:27:32,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:27:32,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:27:32,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:27:32,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:27:32,531 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 6 treesize of output 5 [2018-12-09 01:27:32,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 01:27:32,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 01:27:32,590 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:27:32,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-12-09 01:27:32,647 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 23 treesize of output 18 [2018-12-09 01:27:32,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:32,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:32,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-09 01:27:32,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-12-09 01:27:32,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:32,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 89 [2018-12-09 01:27:32,740 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-12-09 01:27:32,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:32,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:32,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:82 [2018-12-09 01:27:36,862 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 01:27:37,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:37,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 52 [2018-12-09 01:27:37,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2018-12-09 01:27:37,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:37,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:37,376 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-12-09 01:27:37,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:37,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-09 01:27:37,380 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:37,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:27:37,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:37,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:37,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:37,405 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:75, output treesize:23 [2018-12-09 01:27:43,868 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 01:27:43,874 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:27:43,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:43,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 105 [2018-12-09 01:27:43,955 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 30 treesize of output 41 [2018-12-09 01:27:43,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:27:44,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:27:44,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:44,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:131, output treesize:150 [2018-12-09 01:27:46,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:46,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 01:27:46,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:46,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-09 01:27:46,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:46,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:46,413 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 25 treesize of output 19 [2018-12-09 01:27:46,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:46,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-09 01:27:46,417 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:46,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:46,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:46,433 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:23 [2018-12-09 01:27:48,590 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 57 treesize of output 46 [2018-12-09 01:27:48,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:48,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:48,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:48,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 62 [2018-12-09 01:27:48,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:48,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:48,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:48,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:68 [2018-12-09 01:27:50,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:50,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-09 01:27:50,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:50,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:50,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-09 01:27:50,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:50,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:27:50,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:50,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:31 [2018-12-09 01:27:52,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 95 treesize of output 83 [2018-12-09 01:27:52,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2018-12-09 01:27:52,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:52,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-12-09 01:27:52,263 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 01:27:52,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:27:52,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2018-12-09 01:27:52,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:27:52,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:52,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:27:52,397 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:103, output treesize:75 [2018-12-09 01:28:10,621 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2018-12-09 01:28:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:28:10,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:28:12,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:12,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:12,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:12,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:34 [2018-12-09 01:28:12,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:12,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:12,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:12,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:12,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:28:12,858 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:86 [2018-12-09 01:28:23,354 WARN L180 SmtUtils]: Spent 8.29 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 01:28:23,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:23,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:23,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:23,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:68 [2018-12-09 01:28:23,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:28:23,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:28:23,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 01:28:23,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 01:28:23,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:28:23,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:28:24,745 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 13 treesize of output 10 [2018-12-09 01:28:24,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 01:28:24,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:28:24,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:28:24,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:28:24,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2018-12-09 01:28:24,945 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 23 treesize of output 18 [2018-12-09 01:28:24,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:28:24,949 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 18 treesize of output 27 [2018-12-09 01:28:24,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:28:24,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:28:24,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:28:24,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:44 [2018-12-09 01:28:25,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:28:25,191 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-12-09 01:28:25,194 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 16 treesize of output 15 [2018-12-09 01:28:25,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:28:25,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:28:25,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:25,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:68 [2018-12-09 01:28:28,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:28:28,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 01:28:28,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:28:28,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-09 01:28:28,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:28:28,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:28:28,692 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-12-09 01:28:28,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 01:28:28,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:28:28,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-09 01:28:28,703 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:28,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:28,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:28:28,714 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:58, output treesize:19 [2018-12-09 01:29:07,840 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 01:29:07,848 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 01:29:07,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:29:07,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 97 [2018-12-09 01:29:07,943 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 32 treesize of output 21 [2018-12-09 01:29:07,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 01:29:07,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 01:29:08,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-12-09 01:29:08,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:106, output treesize:136 [2018-12-09 01:29:16,670 WARN L180 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 23 [2018-12-09 01:29:16,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:29:16,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 01:29:16,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:29:16,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-12-09 01:29:16,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:16,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:16,705 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 26 treesize of output 20 [2018-12-09 01:29:16,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-12-09 01:29:16,708 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:16,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:16,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:16,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:19 [2018-12-09 01:29:19,061 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 57 treesize of output 46 [2018-12-09 01:29:19,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:29:19,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 01:29:19,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2018-12-09 01:29:19,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:19,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 01:29:19,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:19,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:60 [2018-12-09 01:29:21,458 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 01:29:21,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:21,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:21,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-12-09 01:29:25,255 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 64 treesize of output 58 [2018-12-09 01:29:25,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-12-09 01:29:25,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:25,310 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2018-12-09 01:29:25,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:25,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-12-09 01:29:25,363 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 01:29:25,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 01:29:25,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 01:29:25,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:53 [2018-12-09 01:29:27,438 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_74 (_ BitVec 32)) (v_arrayElimCell_216 (_ BitVec 32))) (let ((.cse0 (store |c_old(#valid)| v_arrayElimCell_216 (_ bv1 1)))) (and (= |c_#valid| (store (store .cse0 v_prenex_74 (_ bv0 1)) v_arrayElimCell_216 (_ bv0 1))) (= (select .cse0 v_prenex_74) (_ bv0 1)) (= (select |c_old(#valid)| v_arrayElimCell_216) (_ bv0 1))))) (exists ((v_arrayElimCell_215 (_ BitVec 32)) (main_~s~0.base (_ BitVec 32))) (let ((.cse1 (store |c_old(#valid)| v_arrayElimCell_215 (_ bv1 1)))) (and (= |c_#valid| (store (store .cse1 main_~s~0.base (_ bv0 1)) v_arrayElimCell_215 (_ bv0 1))) (= (select .cse1 main_~s~0.base) (_ bv0 1)) (= (select |c_old(#valid)| v_arrayElimCell_215) (_ bv0 1)))))) is different from true [2018-12-09 01:29:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 01:29:27,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:29:29,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:29,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:29,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:29,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2018-12-09 01:29:29,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:29,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:29,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:29,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:35 [2018-12-09 01:29:37,700 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:37,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:37,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 01:29:37,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:35 [2018-12-09 01:29:38,973 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_146 (_ BitVec 32)) (v_dll_update_at_~head.offset_113 (_ BitVec 32))) (= (store (store |c_#valid| c_main_~s~0.base (_ bv0 1)) (let ((.cse1 (bvadd c_main_~s~0.offset (_ bv4 32)))) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_main_~s~0.base) .cse1))) (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) v_dll_update_at_~head.offset_113 v_DerPreprocessor_146))) c_main_~s~0.base) .cse1)) (_ bv0 1)) |c_old(#valid)|)) is different from false [2018-12-09 01:29:38,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 01:29:38,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27] total 57 [2018-12-09 01:29:38,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-09 01:29:38,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-09 01:29:38,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=5886, Unknown=38, NotChecked=314, Total=6642 [2018-12-09 01:29:38,993 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 58 states. [2018-12-09 01:30:58,367 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2018-12-09 01:31:10,983 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2018-12-09 01:31:27,893 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2018-12-09 01:31:56,139 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-09 01:33:03,739 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-09 01:33:04,366 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2018-12-09 01:33:04,874 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-12-09 01:33:22,748 WARN L180 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 63 DAG size of output: 37 [2018-12-09 01:33:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:27,887 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-12-09 01:33:27,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 01:33:27,888 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 67 [2018-12-09 01:33:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:27,888 INFO L225 Difference]: With dead ends: 125 [2018-12-09 01:33:27,888 INFO L226 Difference]: Without dead ends: 82 [2018-12-09 01:33:27,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 99 SyntacticMatches, 16 SemanticMatches, 104 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4152 ImplicationChecksByTransitivity, 199.2s TimeCoverageRelationStatistics Valid=791, Invalid=9871, Unknown=58, NotChecked=410, Total=11130 [2018-12-09 01:33:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-09 01:33:27,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-09 01:33:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 01:33:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-12-09 01:33:27,891 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 67 [2018-12-09 01:33:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:27,891 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-12-09 01:33:27,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-09 01:33:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-12-09 01:33:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 01:33:27,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:27,892 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:27,892 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:33:27,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash -987935254, now seen corresponding path program 3 times [2018-12-09 01:33:27,892 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:33:27,892 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:33:27,905 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 01:33:28,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 01:33:28,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:33:28,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:33:28,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:28,900 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:33:28,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:28,904 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:28,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 01:33:42,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 01:33:42,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:33:42,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:33:42,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-09 01:33:42,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:33:42,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 15 [2018-12-09 01:33:42,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 01:33:42,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 01:33:42,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-12-09 01:33:42,788 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 15 states. [2018-12-09 01:33:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:43,312 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-12-09 01:33:43,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 01:33:43,312 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2018-12-09 01:33:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:43,313 INFO L225 Difference]: With dead ends: 100 [2018-12-09 01:33:43,313 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 01:33:43,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 271 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-12-09 01:33:43,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 01:33:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2018-12-09 01:33:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-09 01:33:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-09 01:33:43,314 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 72 [2018-12-09 01:33:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:43,314 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-09 01:33:43,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 01:33:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-09 01:33:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-09 01:33:43,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 01:33:43,315 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 01:33:43,315 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_update_atErr0REQUIRES_VIOLATION, dll_update_atErr1REQUIRES_VIOLATION, dll_update_atErr3REQUIRES_VIOLATION, dll_update_atErr2REQUIRES_VIOLATION, dll_createErr6REQUIRES_VIOLATION, dll_createErr1REQUIRES_VIOLATION, dll_createErr0REQUIRES_VIOLATION, dll_createErr5REQUIRES_VIOLATION, dll_createErr4REQUIRES_VIOLATION, dll_createErr3REQUIRES_VIOLATION, dll_createErr2REQUIRES_VIOLATION, dll_createErr7REQUIRES_VIOLATION, dll_get_data_atErr1REQUIRES_VIOLATION, dll_get_data_atErr0REQUIRES_VIOLATION, dll_get_data_atErr3REQUIRES_VIOLATION, dll_get_data_atErr2REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_destroyErr1REQUIRES_VIOLATION, dll_destroyErr0REQUIRES_VIOLATION, dll_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, dll_destroyErr2ASSERT_VIOLATIONMEMORY_FREE]=== [2018-12-09 01:33:43,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 01:33:43,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1648166698, now seen corresponding path program 4 times [2018-12-09 01:33:43,315 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 01:33:43,315 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 01:33:43,329 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:33:43,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:33:43,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:33:43,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:33:43,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:33:43,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 01:33:43,714 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 01:33:43,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 01:33:43,771 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 01:33:43,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 01:33:43,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 01:33:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:33:43,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 01:33:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-09 01:33:43,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 01:33:43,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7] total 11 [2018-12-09 01:33:43,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 01:33:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 01:33:43,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-09 01:33:43,837 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 11 states. [2018-12-09 01:33:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 01:33:44,006 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-09 01:33:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 01:33:44,006 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2018-12-09 01:33:44,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 01:33:44,007 INFO L225 Difference]: With dead ends: 43 [2018-12-09 01:33:44,007 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 01:33:44,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-12-09 01:33:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 01:33:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 01:33:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 01:33:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 01:33:44,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-12-09 01:33:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 01:33:44,007 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 01:33:44,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 01:33:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 01:33:44,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 01:33:44,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:33:44 BoogieIcfgContainer [2018-12-09 01:33:44,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 01:33:44,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 01:33:44,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 01:33:44,011 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 01:33:44,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:22:27" (3/4) ... [2018-12-09 01:33:44,013 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 01:33:44,017 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_update_at [2018-12-09 01:33:44,018 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 01:33:44,018 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2018-12-09 01:33:44,018 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_create [2018-12-09 01:33:44,018 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_get_data_at [2018-12-09 01:33:44,018 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 01:33:44,018 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_destroy [2018-12-09 01:33:44,021 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-09 01:33:44,021 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-09 01:33:44,021 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 01:33:44,046 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a6851681-aea2-4385-a905-dcb7bd478156/bin-2019/utaipan/witness.graphml [2018-12-09 01:33:44,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 01:33:44,047 INFO L168 Benchmark]: Toolchain (without parser) took 677665.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 938.0 MB in the beginning and 869.5 MB in the end (delta: 68.5 MB). Peak memory consumption was 275.6 MB. Max. memory is 11.5 GB. [2018-12-09 01:33:44,047 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 01:33:44,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-09 01:33:44,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.16 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-09 01:33:44,048 INFO L168 Benchmark]: Boogie Preprocessor took 20.84 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-09 01:33:44,048 INFO L168 Benchmark]: RCFGBuilder took 297.89 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-12-09 01:33:44,048 INFO L168 Benchmark]: TraceAbstraction took 676999.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 877.3 MB in the end (delta: 219.9 MB). Peak memory consumption was 270.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:33:44,048 INFO L168 Benchmark]: Witness Printer took 35.98 ms. Allocated memory is still 1.2 GB. Free memory was 877.3 MB in the beginning and 869.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. [2018-12-09 01:33:44,049 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 291.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -198.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.16 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 20.84 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.89 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 676999.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 877.3 MB in the end (delta: 219.9 MB). Peak memory consumption was 270.8 MB. Max. memory is 11.5 GB. * Witness Printer took 35.98 ms. Allocated memory is still 1.2 GB. Free memory was 877.3 MB in the beginning and 869.5 MB in the end (delta: 7.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 611]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 583]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 582]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 585]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 601]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 604]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 84 locations, 21 error locations. SAFE Result, 676.9s OverallTime, 24 OverallIterations, 4 TraceHistogramMax, 383.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1160 SDtfs, 1548 SDslu, 7042 SDs, 0 SdLazy, 8938 SolverSat, 522 SolverUnsat, 75 SolverUnknown, 0 SolverNotchecked, 178.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3089 GetRequests, 2344 SyntacticMatches, 115 SemanticMatches, 630 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 9349 ImplicationChecksByTransitivity, 440.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 160 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 17.0s SatisfiabilityAnalysisTime, 274.8s InterpolantComputationTime, 1768 NumberOfCodeBlocks, 1768 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2667 ConstructedInterpolants, 338 QuantifiedInterpolants, 2139133 SizeOfPredicates, 434 NumberOfNonLiveVariables, 6989 ConjunctsInSsa, 931 ConjunctsInUnsatCore, 62 InterpolantComputations, 10 PerfectInterpolantSequences, 633/1162 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...