./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_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_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 976e1955e162f3b4e872a15f7e9a64e265f0afc5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 976e1955e162f3b4e872a15f7e9a64e265f0afc5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 17:53:35,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:53:35,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:53:35,721 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:53:35,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:53:35,721 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:53:35,722 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:53:35,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:53:35,723 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:53:35,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:53:35,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:53:35,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:53:35,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:53:35,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:53:35,726 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:53:35,726 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:53:35,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:53:35,727 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:53:35,728 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:53:35,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:53:35,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:53:35,730 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:53:35,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:53:35,731 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:53:35,731 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:53:35,731 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:53:35,732 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:53:35,732 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:53:35,733 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:53:35,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:53:35,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:53:35,734 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:53:35,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:53:35,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:53:35,734 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:53:35,734 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:53:35,735 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 17:53:35,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:53:35,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:53:35,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:53:35,742 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:53:35,742 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:53:35,742 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:53:35,742 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:53:35,743 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 17:53:35,743 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:53:35,743 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:53:35,743 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 17:53:35,743 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 17:53:35,743 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:53:35,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 17:53:35,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 17:53:35,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:53:35,744 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:53:35,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:53:35,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:53:35,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:53:35,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:53:35,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:53:35,745 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:53:35,745 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:53:35,745 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 17:53:35,745 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:53:35,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 17:53:35,746 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_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 -> 976e1955e162f3b4e872a15f7e9a64e265f0afc5 [2018-12-09 17:53:35,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:53:35,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:53:35,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:53:35,774 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:53:35,774 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:53:35,774 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2018-12-09 17:53:35,811 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data/adb8948b5/4e6eb8cd66354212992235f22da269b6/FLAGd1a902204 [2018-12-09 17:53:36,221 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:53:36,221 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2018-12-09 17:53:36,229 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data/adb8948b5/4e6eb8cd66354212992235f22da269b6/FLAGd1a902204 [2018-12-09 17:53:36,237 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data/adb8948b5/4e6eb8cd66354212992235f22da269b6 [2018-12-09 17:53:36,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:53:36,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:53:36,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:53:36,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:53:36,242 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:53:36,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56f13b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36, skipping insertion in model container [2018-12-09 17:53:36,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:53:36,271 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:53:36,484 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:53:36,493 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:53:36,526 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:53:36,558 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:53:36,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36 WrapperNode [2018-12-09 17:53:36,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:53:36,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:53:36,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:53:36,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:53:36,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:53:36,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:53:36,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:53:36,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:53:36,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... [2018-12-09 17:53:36,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:53:36,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:53:36,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:53:36,602 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:53:36,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:53:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:53:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-09 17:53:36,634 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-09 17:53:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-09 17:53:36,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-09 17:53:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 17:53:36,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 17:53:36,634 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-12-09 17:53:36,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-09 17:53:36,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2018-12-09 17:53:36,635 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 17:53:36,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 17:53:36,635 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 17:53:36,635 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-12-09 17:53:36,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-12-09 17:53:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2018-12-09 17:53:36,636 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2018-12-09 17:53:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 17:53:36,636 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 17:53:36,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:53:36,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:53:36,865 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:53:36,866 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 17:53:36,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:53:36 BoogieIcfgContainer [2018-12-09 17:53:36,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:53:36,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:53:36,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:53:36,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:53:36,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:53:36" (1/3) ... [2018-12-09 17:53:36,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e98dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:53:36, skipping insertion in model container [2018-12-09 17:53:36,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:53:36" (2/3) ... [2018-12-09 17:53:36,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e98dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:53:36, skipping insertion in model container [2018-12-09 17:53:36,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:53:36" (3/3) ... [2018-12-09 17:53:36,870 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_true-valid-memsafety.i [2018-12-09 17:53:36,876 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:53:36,880 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-09 17:53:36,889 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-09 17:53:36,905 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:53:36,905 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 17:53:36,905 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:53:36,905 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:53:36,905 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:53:36,905 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:53:36,905 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:53:36,905 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:53:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-12-09 17:53:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 17:53:36,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:36,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:36,923 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:36,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1627156754, now seen corresponding path program 1 times [2018-12-09 17:53:36,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:36,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:36,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:37,052 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 17:53:37,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:37,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:53:37,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:37,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:53:37,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:53:37,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:53:37,071 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 5 states. [2018-12-09 17:53:37,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:37,097 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-12-09 17:53:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:53:37,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 17:53:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:37,105 INFO L225 Difference]: With dead ends: 106 [2018-12-09 17:53:37,105 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 17:53:37,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:53:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 17:53:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-09 17:53:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 17:53:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-09 17:53:37,130 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 17 [2018-12-09 17:53:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:37,130 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-09 17:53:37,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:53:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-09 17:53:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 17:53:37,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:37,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:37,131 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:37,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash -115653581, now seen corresponding path program 1 times [2018-12-09 17:53:37,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:37,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:37,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:37,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:37,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:37,220 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 17:53:37,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:37,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:53:37,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:37,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:53:37,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:53:37,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:53:37,221 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 7 states. [2018-12-09 17:53:37,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:37,482 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-12-09 17:53:37,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:53:37,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-09 17:53:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:37,484 INFO L225 Difference]: With dead ends: 148 [2018-12-09 17:53:37,484 INFO L226 Difference]: Without dead ends: 145 [2018-12-09 17:53:37,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:53:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-09 17:53:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2018-12-09 17:53:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 17:53:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-09 17:53:37,494 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 17 [2018-12-09 17:53:37,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:37,494 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-09 17:53:37,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:53:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-09 17:53:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 17:53:37,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:37,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:37,495 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:37,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash -115653580, now seen corresponding path program 1 times [2018-12-09 17:53:37,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:37,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:37,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:37,573 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 17:53:37,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:37,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:53:37,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:37,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 17:53:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 17:53:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:53:37,575 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 8 states. [2018-12-09 17:53:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:37,910 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-09 17:53:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:53:37,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-09 17:53:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:37,911 INFO L225 Difference]: With dead ends: 143 [2018-12-09 17:53:37,911 INFO L226 Difference]: Without dead ends: 143 [2018-12-09 17:53:37,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-12-09 17:53:37,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-09 17:53:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 104. [2018-12-09 17:53:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 17:53:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-12-09 17:53:37,917 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 17 [2018-12-09 17:53:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:37,917 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-12-09 17:53:37,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 17:53:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-12-09 17:53:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 17:53:37,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:37,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:37,918 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:37,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash -871985669, now seen corresponding path program 1 times [2018-12-09 17:53:37,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:37,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:37,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:37,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:37,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:37,973 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 17:53:37,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:37,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:53:37,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:37,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 17:53:37,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 17:53:37,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 17:53:37,974 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 8 states. [2018-12-09 17:53:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:38,126 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-12-09 17:53:38,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:53:38,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-12-09 17:53:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:38,127 INFO L225 Difference]: With dead ends: 143 [2018-12-09 17:53:38,127 INFO L226 Difference]: Without dead ends: 143 [2018-12-09 17:53:38,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 17:53:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-09 17:53:38,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2018-12-09 17:53:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 17:53:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-12-09 17:53:38,133 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 20 [2018-12-09 17:53:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:38,133 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-12-09 17:53:38,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 17:53:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-12-09 17:53:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 17:53:38,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:38,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:38,134 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:38,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:38,134 INFO L82 PathProgramCache]: Analyzing trace with hash -871985668, now seen corresponding path program 1 times [2018-12-09 17:53:38,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:38,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:38,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:38,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:38,272 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 17:53:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:38,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 17:53:38,273 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:38,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 17:53:38,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 17:53:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:53:38,273 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 11 states. [2018-12-09 17:53:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:38,862 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2018-12-09 17:53:38,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 17:53:38,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 17:53:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:38,864 INFO L225 Difference]: With dead ends: 141 [2018-12-09 17:53:38,864 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 17:53:38,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-12-09 17:53:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 17:53:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 113. [2018-12-09 17:53:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-09 17:53:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-12-09 17:53:38,871 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2018-12-09 17:53:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:38,872 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-12-09 17:53:38,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 17:53:38,872 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-12-09 17:53:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:53:38,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:38,873 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] [2018-12-09 17:53:38,873 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:38,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:38,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1261751943, now seen corresponding path program 1 times [2018-12-09 17:53:38,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:38,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:38,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:38,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:38,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:38,922 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 17:53:38,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:38,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:53:38,923 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:38,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:53:38,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:53:38,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:53:38,923 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 9 states. [2018-12-09 17:53:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:39,049 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-12-09 17:53:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:53:39,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-09 17:53:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:39,050 INFO L225 Difference]: With dead ends: 111 [2018-12-09 17:53:39,050 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 17:53:39,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:53:39,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 17:53:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-09 17:53:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 17:53:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-09 17:53:39,056 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 21 [2018-12-09 17:53:39,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:39,057 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-09 17:53:39,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:53:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-09 17:53:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:53:39,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:39,058 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] [2018-12-09 17:53:39,058 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:39,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:39,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1261751942, now seen corresponding path program 1 times [2018-12-09 17:53:39,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:39,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:39,147 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 17:53:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 17:53:39,148 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:39,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:53:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:53:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:53:39,148 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 10 states. [2018-12-09 17:53:39,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:39,308 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-12-09 17:53:39,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:53:39,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-09 17:53:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:39,308 INFO L225 Difference]: With dead ends: 109 [2018-12-09 17:53:39,308 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 17:53:39,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:53:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 17:53:39,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-09 17:53:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 17:53:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-12-09 17:53:39,312 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 21 [2018-12-09 17:53:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:39,312 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-12-09 17:53:39,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:53:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-12-09 17:53:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:53:39,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:39,312 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] [2018-12-09 17:53:39,313 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:39,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 755715794, now seen corresponding path program 1 times [2018-12-09 17:53:39,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:39,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:39,346 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 17:53:39,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:39,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:53:39,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:39,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:53:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:53:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:53:39,347 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 6 states. [2018-12-09 17:53:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:39,482 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-12-09 17:53:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:53:39,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-12-09 17:53:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:39,484 INFO L225 Difference]: With dead ends: 141 [2018-12-09 17:53:39,484 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 17:53:39,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:53:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 17:53:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-12-09 17:53:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 17:53:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-12-09 17:53:39,489 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 21 [2018-12-09 17:53:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:39,490 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-12-09 17:53:39,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:53:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-12-09 17:53:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:53:39,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:39,490 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] [2018-12-09 17:53:39,491 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:39,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:39,491 INFO L82 PathProgramCache]: Analyzing trace with hash 755715795, now seen corresponding path program 1 times [2018-12-09 17:53:39,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:39,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:39,560 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 17:53:39,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:39,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:53:39,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:39,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:53:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:53:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:53:39,561 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 7 states. [2018-12-09 17:53:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:39,842 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-12-09 17:53:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:53:39,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-09 17:53:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:39,844 INFO L225 Difference]: With dead ends: 142 [2018-12-09 17:53:39,844 INFO L226 Difference]: Without dead ends: 142 [2018-12-09 17:53:39,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:53:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-09 17:53:39,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2018-12-09 17:53:39,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 17:53:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-12-09 17:53:39,849 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 21 [2018-12-09 17:53:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:39,849 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-12-09 17:53:39,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:53:39,849 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-12-09 17:53:39,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:53:39,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:39,850 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] [2018-12-09 17:53:39,850 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:39,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash 626633076, now seen corresponding path program 1 times [2018-12-09 17:53:39,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:39,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:39,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:39,868 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 17:53:39,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:39,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:53:39,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:39,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:53:39,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:53:39,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:53:39,868 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 5 states. [2018-12-09 17:53:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:39,874 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2018-12-09 17:53:39,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:53:39,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 17:53:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:39,876 INFO L225 Difference]: With dead ends: 111 [2018-12-09 17:53:39,876 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 17:53:39,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:53:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 17:53:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-12-09 17:53:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 17:53:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2018-12-09 17:53:39,879 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 21 [2018-12-09 17:53:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:39,879 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2018-12-09 17:53:39,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:53:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2018-12-09 17:53:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 17:53:39,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:39,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:39,880 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:39,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:39,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1362839012, now seen corresponding path program 1 times [2018-12-09 17:53:39,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:39,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:39,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:39,901 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 17:53:39,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:39,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:53:39,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:39,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:53:39,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:53:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:53:39,903 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand 5 states. [2018-12-09 17:53:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:39,965 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-12-09 17:53:39,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:53:39,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-09 17:53:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:39,966 INFO L225 Difference]: With dead ends: 108 [2018-12-09 17:53:39,966 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 17:53:39,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:53:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 17:53:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-09 17:53:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-09 17:53:39,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-12-09 17:53:39,968 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 23 [2018-12-09 17:53:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:39,969 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-12-09 17:53:39,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:53:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-12-09 17:53:39,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 17:53:39,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:39,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:39,970 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:39,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:39,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1362839011, now seen corresponding path program 1 times [2018-12-09 17:53:39,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:39,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:39,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:53:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 17:53:40,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:40,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:53:40,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:53:40,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:53:40,081 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 10 states. [2018-12-09 17:53:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:40,308 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-12-09 17:53:40,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:53:40,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-09 17:53:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:40,310 INFO L225 Difference]: With dead ends: 128 [2018-12-09 17:53:40,310 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 17:53:40,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-12-09 17:53:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 17:53:40,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-12-09 17:53:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-09 17:53:40,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2018-12-09 17:53:40,315 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 23 [2018-12-09 17:53:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:40,315 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2018-12-09 17:53:40,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:53:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2018-12-09 17:53:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 17:53:40,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:40,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:40,316 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:40,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash -992923394, now seen corresponding path program 1 times [2018-12-09 17:53:40,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:40,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:40,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:40,345 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 17:53:40,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:40,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 17:53:40,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:40,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:53:40,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:53:40,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:53:40,346 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 5 states. [2018-12-09 17:53:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:40,422 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-12-09 17:53:40,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 17:53:40,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-12-09 17:53:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:40,425 INFO L225 Difference]: With dead ends: 121 [2018-12-09 17:53:40,425 INFO L226 Difference]: Without dead ends: 121 [2018-12-09 17:53:40,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:53:40,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-09 17:53:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-12-09 17:53:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-09 17:53:40,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-12-09 17:53:40,429 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 26 [2018-12-09 17:53:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:40,429 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-12-09 17:53:40,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:53:40,430 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2018-12-09 17:53:40,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 17:53:40,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:40,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:40,430 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:40,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:40,431 INFO L82 PathProgramCache]: Analyzing trace with hash -992923393, now seen corresponding path program 1 times [2018-12-09 17:53:40,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:40,513 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 17:53:40,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:40,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:53:40,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:40,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:53:40,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:53:40,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:53:40,514 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 7 states. [2018-12-09 17:53:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:40,628 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-12-09 17:53:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:53:40,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 17:53:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:40,629 INFO L225 Difference]: With dead ends: 120 [2018-12-09 17:53:40,629 INFO L226 Difference]: Without dead ends: 120 [2018-12-09 17:53:40,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:53:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-09 17:53:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2018-12-09 17:53:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 17:53:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-12-09 17:53:40,632 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 26 [2018-12-09 17:53:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:40,632 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-12-09 17:53:40,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:53:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-12-09 17:53:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 17:53:40,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:40,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:40,633 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:40,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash -787755985, now seen corresponding path program 1 times [2018-12-09 17:53:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:40,657 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 17:53:40,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:40,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:53:40,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:40,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:53:40,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:53:40,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:53:40,657 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 6 states. [2018-12-09 17:53:40,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:40,761 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-12-09 17:53:40,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:53:40,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 17:53:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:40,762 INFO L225 Difference]: With dead ends: 139 [2018-12-09 17:53:40,762 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 17:53:40,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:53:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 17:53:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2018-12-09 17:53:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-09 17:53:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-12-09 17:53:40,765 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2018-12-09 17:53:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:40,765 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-12-09 17:53:40,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:53:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-12-09 17:53:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 17:53:40,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:40,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:40,766 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:40,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:40,766 INFO L82 PathProgramCache]: Analyzing trace with hash -787755984, now seen corresponding path program 1 times [2018-12-09 17:53:40,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:40,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:40,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:40,813 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 17:53:40,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:40,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:53:40,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:40,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:53:40,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:53:40,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:53:40,814 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 6 states. [2018-12-09 17:53:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:40,970 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-12-09 17:53:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:53:40,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 17:53:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:40,970 INFO L225 Difference]: With dead ends: 126 [2018-12-09 17:53:40,971 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 17:53:40,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:53:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 17:53:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 17:53:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 17:53:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-12-09 17:53:40,973 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 28 [2018-12-09 17:53:40,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:40,973 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-12-09 17:53:40,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:53:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-12-09 17:53:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:53:40,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:40,973 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:40,974 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:40,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:40,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1950839153, now seen corresponding path program 1 times [2018-12-09 17:53:40,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:40,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:40,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:40,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:41,061 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 17:53:41,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:41,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 17:53:41,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:41,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 17:53:41,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 17:53:41,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:53:41,061 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 12 states. [2018-12-09 17:53:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:41,323 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-09 17:53:41,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 17:53:41,324 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-12-09 17:53:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:41,325 INFO L225 Difference]: With dead ends: 117 [2018-12-09 17:53:41,325 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 17:53:41,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-12-09 17:53:41,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 17:53:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-12-09 17:53:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 17:53:41,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-12-09 17:53:41,328 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-12-09 17:53:41,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:41,328 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-12-09 17:53:41,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 17:53:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-12-09 17:53:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:53:41,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:41,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:41,329 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:41,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:41,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1950839154, now seen corresponding path program 1 times [2018-12-09 17:53:41,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:41,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:41,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:41,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:41,482 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 17:53:41,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:41,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 17:53:41,483 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:41,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 17:53:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 17:53:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:53:41,484 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 13 states. [2018-12-09 17:53:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:41,775 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-12-09 17:53:41,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 17:53:41,775 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-12-09 17:53:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:41,776 INFO L225 Difference]: With dead ends: 112 [2018-12-09 17:53:41,776 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 17:53:41,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-12-09 17:53:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 17:53:41,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-12-09 17:53:41,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 17:53:41,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-12-09 17:53:41,778 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 35 [2018-12-09 17:53:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:41,778 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-12-09 17:53:41,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 17:53:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-12-09 17:53:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 17:53:41,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:41,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:41,778 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:41,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:41,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1221797440, now seen corresponding path program 1 times [2018-12-09 17:53:41,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:41,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:41,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:41,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:41,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:41,970 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 17:53:41,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:41,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 17:53:41,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:41,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 17:53:41,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 17:53:41,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-12-09 17:53:41,972 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 16 states. [2018-12-09 17:53:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:42,331 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2018-12-09 17:53:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 17:53:42,331 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-12-09 17:53:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:42,332 INFO L225 Difference]: With dead ends: 110 [2018-12-09 17:53:42,332 INFO L226 Difference]: Without dead ends: 110 [2018-12-09 17:53:42,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2018-12-09 17:53:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-09 17:53:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2018-12-09 17:53:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 17:53:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2018-12-09 17:53:42,335 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 40 [2018-12-09 17:53:42,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:42,335 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2018-12-09 17:53:42,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 17:53:42,335 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2018-12-09 17:53:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 17:53:42,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:42,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:42,336 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:42,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:42,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1692383055, now seen corresponding path program 1 times [2018-12-09 17:53:42,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:42,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:42,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:42,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:42,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:42,484 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 17:53:42,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:42,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 17:53:42,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:42,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 17:53:42,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 17:53:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-12-09 17:53:42,485 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 17 states. [2018-12-09 17:53:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:42,950 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-09 17:53:42,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 17:53:42,950 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-12-09 17:53:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:42,951 INFO L225 Difference]: With dead ends: 102 [2018-12-09 17:53:42,951 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 17:53:42,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 17:53:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 17:53:42,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-09 17:53:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:53:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-12-09 17:53:42,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 42 [2018-12-09 17:53:42,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:42,953 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-12-09 17:53:42,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 17:53:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-12-09 17:53:42,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 17:53:42,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:42,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:42,953 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:42,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1034005355, now seen corresponding path program 1 times [2018-12-09 17:53:42,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:42,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:42,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:42,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:42,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:43,306 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 17:53:43,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:43,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-09 17:53:43,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:43,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 17:53:43,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 17:53:43,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-12-09 17:53:43,307 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 26 states. [2018-12-09 17:53:43,909 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-12-09 17:53:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:45,390 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-09 17:53:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 17:53:45,390 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-12-09 17:53:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:45,391 INFO L225 Difference]: With dead ends: 101 [2018-12-09 17:53:45,391 INFO L226 Difference]: Without dead ends: 101 [2018-12-09 17:53:45,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=308, Invalid=2448, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 17:53:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-09 17:53:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-12-09 17:53:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:53:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-12-09 17:53:45,393 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 44 [2018-12-09 17:53:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:45,393 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-12-09 17:53:45,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 17:53:45,394 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-12-09 17:53:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 17:53:45,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:45,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:45,394 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:45,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:45,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1034005356, now seen corresponding path program 1 times [2018-12-09 17:53:45,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:45,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:45,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:45,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:45,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:45,961 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 17:53:45,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:45,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2018-12-09 17:53:45,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:45,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-09 17:53:45,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-09 17:53:45,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756 [2018-12-09 17:53:45,962 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 28 states. [2018-12-09 17:53:46,521 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2018-12-09 17:53:46,857 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2018-12-09 17:53:47,268 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-12-09 17:53:47,621 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2018-12-09 17:53:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:48,975 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-09 17:53:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 17:53:48,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 44 [2018-12-09 17:53:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:48,978 INFO L225 Difference]: With dead ends: 100 [2018-12-09 17:53:48,979 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 17:53:48,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=328, Invalid=2642, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 17:53:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 17:53:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-12-09 17:53:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:53:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-12-09 17:53:48,988 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 44 [2018-12-09 17:53:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:48,989 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-12-09 17:53:48,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-09 17:53:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-12-09 17:53:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:53:48,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:48,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:48,992 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:48,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1989394924, now seen corresponding path program 1 times [2018-12-09 17:53:48,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:48,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:48,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:48,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:48,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:49,499 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 17:53:49,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:49,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-12-09 17:53:49,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:49,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 17:53:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 17:53:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2018-12-09 17:53:49,500 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 24 states. [2018-12-09 17:53:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:50,831 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-09 17:53:50,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-09 17:53:50,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-09 17:53:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:50,832 INFO L225 Difference]: With dead ends: 99 [2018-12-09 17:53:50,832 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 17:53:50,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=2011, Unknown=0, NotChecked=0, Total=2256 [2018-12-09 17:53:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 17:53:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-12-09 17:53:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:53:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-12-09 17:53:50,834 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 45 [2018-12-09 17:53:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:50,834 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-12-09 17:53:50,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 17:53:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-12-09 17:53:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:53:50,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:50,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:53:50,835 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:50,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1989394925, now seen corresponding path program 1 times [2018-12-09 17:53:50,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:50,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:51,333 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 17:53:51,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:51,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-12-09 17:53:51,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:51,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 17:53:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 17:53:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2018-12-09 17:53:51,334 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 24 states. [2018-12-09 17:53:52,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:52,938 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-09 17:53:52,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 17:53:52,939 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-12-09 17:53:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:52,939 INFO L225 Difference]: With dead ends: 98 [2018-12-09 17:53:52,939 INFO L226 Difference]: Without dead ends: 98 [2018-12-09 17:53:52,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=224, Invalid=1846, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 17:53:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-09 17:53:52,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-09 17:53:52,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:53:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-09 17:53:52,941 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 45 [2018-12-09 17:53:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:52,941 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-09 17:53:52,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 17:53:52,941 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-09 17:53:52,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 17:53:52,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:52,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:53:52,942 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:52,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:52,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1304629992, now seen corresponding path program 1 times [2018-12-09 17:53:52,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:52,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:52,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:52,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:53,157 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 17:53:53,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:53,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 17:53:53,157 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:53,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 17:53:53,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 17:53:53,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-12-09 17:53:53,158 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 17 states. [2018-12-09 17:53:53,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:53,441 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-09 17:53:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 17:53:53,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2018-12-09 17:53:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:53,442 INFO L225 Difference]: With dead ends: 97 [2018-12-09 17:53:53,442 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 17:53:53,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-12-09 17:53:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 17:53:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 17:53:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:53:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-09 17:53:53,444 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 51 [2018-12-09 17:53:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:53,444 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-09 17:53:53,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 17:53:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-09 17:53:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 17:53:53,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:53,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:53:53,445 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:53,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:53,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1073148402, now seen corresponding path program 1 times [2018-12-09 17:53:53,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:53,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:53,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:53,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:53,946 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 17:53:53,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:53,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2018-12-09 17:53:53,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:53,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 17:53:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 17:53:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2018-12-09 17:53:53,947 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 30 states. [2018-12-09 17:53:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:57,412 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-09 17:53:57,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-09 17:53:57,413 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2018-12-09 17:53:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:57,413 INFO L225 Difference]: With dead ends: 100 [2018-12-09 17:53:57,413 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 17:53:57,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=293, Invalid=3247, Unknown=0, NotChecked=0, Total=3540 [2018-12-09 17:53:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 17:53:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-12-09 17:53:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 17:53:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-09 17:53:57,415 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 54 [2018-12-09 17:53:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:57,416 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-09 17:53:57,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 17:53:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-09 17:53:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 17:53:57,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:57,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:53:57,416 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:57,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:57,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1073148403, now seen corresponding path program 1 times [2018-12-09 17:53:57,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:57,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:57,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:57,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:57,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:57,972 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 17:53:57,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:57,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-12-09 17:53:57,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:57,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 17:53:57,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 17:53:57,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2018-12-09 17:53:57,973 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 31 states. [2018-12-09 17:53:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:59,372 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-09 17:53:59,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 17:53:59,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-12-09 17:53:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:59,373 INFO L225 Difference]: With dead ends: 100 [2018-12-09 17:53:59,373 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 17:53:59,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=326, Invalid=3334, Unknown=0, NotChecked=0, Total=3660 [2018-12-09 17:53:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 17:53:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-12-09 17:53:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 17:53:59,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-09 17:53:59,375 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 54 [2018-12-09 17:53:59,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:59,375 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-09 17:53:59,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 17:53:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-09 17:53:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 17:53:59,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:59,376 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:53:59,376 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:59,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:59,376 INFO L82 PathProgramCache]: Analyzing trace with hash 710557809, now seen corresponding path program 1 times [2018-12-09 17:53:59,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:59,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:59,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:59,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:59,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:53:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:53:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:53:59,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:53:59,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:53:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:53:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:53:59,416 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 6 states. [2018-12-09 17:53:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:53:59,502 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-09 17:53:59,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 17:53:59,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-09 17:53:59,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:53:59,503 INFO L225 Difference]: With dead ends: 97 [2018-12-09 17:53:59,503 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 17:53:59,503 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 17:53:59,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 17:53:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 17:53:59,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:53:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-09 17:53:59,504 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 59 [2018-12-09 17:53:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:53:59,504 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-09 17:53:59,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:53:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-09 17:53:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 17:53:59,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:53:59,505 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:53:59,505 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:53:59,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:59,505 INFO L82 PathProgramCache]: Analyzing trace with hash 710557810, now seen corresponding path program 1 times [2018-12-09 17:53:59,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:53:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:59,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:59,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:53:59,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:53:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:53:59,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:53:59,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:53:59,618 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-12-09 17:53:59,619 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [8], [11], [16], [17], [18], [21], [24], [36], [37], [39], [40], [44], [45], [46], [47], [50], [53], [56], [59], [60], [63], [65], [66], [67], [68], [69], [72], [73], [76], [84], [87], [89], [91], [92], [95], [107], [108], [109], [110], [111], [112], [113], [115], [116], [117], [118], [119], [120], [121], [123], [124], [125] [2018-12-09 17:53:59,639 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:53:59,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:53:59,761 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 17:53:59,761 INFO L272 AbstractInterpreter]: Visited 56 different actions 56 times. Never merged. Never widened. Performed 537 root evaluator evaluations with a maximum evaluation depth of 6. Performed 537 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-09 17:53:59,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:53:59,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 17:53:59,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:53:59,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:53:59,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:53:59,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:53:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:53:59,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:53:59,915 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 27 [2018-12-09 17:53:59,918 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 27 treesize of output 19 [2018-12-09 17:53:59,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:53:59,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:53:59,929 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 23 treesize of output 19 [2018-12-09 17:53:59,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-09 17:53:59,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:53:59,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:53:59,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:53:59,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:7 [2018-12-09 17:53:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:53:59,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:54:00,134 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 27 treesize of output 31 [2018-12-09 17:54:00,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 17:54:00,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:00,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:41 [2018-12-09 17:54:00,214 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 23 treesize of output 27 [2018-12-09 17:54:00,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 17:54:00,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:00,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:41 [2018-12-09 17:54:00,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 24 treesize of output 20 [2018-12-09 17:54:00,264 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 11 [2018-12-09 17:54:00,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:00,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:00,270 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 17:54:00,272 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 20 treesize of output 14 [2018-12-09 17:54:00,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:00,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:00,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:00,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:11 [2018-12-09 17:54:00,303 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 16 treesize of output 20 [2018-12-09 17:54:00,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 17:54:00,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:00,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:17 [2018-12-09 17:54:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:00,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 17:54:00,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 33 [2018-12-09 17:54:00,451 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 17:54:00,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 17:54:00,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 17:54:00,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 17:54:00,452 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 20 states. [2018-12-09 17:54:01,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:01,024 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-12-09 17:54:01,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 17:54:01,024 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-12-09 17:54:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:01,024 INFO L225 Difference]: With dead ends: 113 [2018-12-09 17:54:01,025 INFO L226 Difference]: Without dead ends: 113 [2018-12-09 17:54:01,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 17:54:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-09 17:54:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-12-09 17:54:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 17:54:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-09 17:54:01,028 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 59 [2018-12-09 17:54:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:01,029 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-09 17:54:01,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 17:54:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-09 17:54:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 17:54:01,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:01,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:54:01,030 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:54:01,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:01,030 INFO L82 PathProgramCache]: Analyzing trace with hash -124859678, now seen corresponding path program 1 times [2018-12-09 17:54:01,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:01,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:01,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:01,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:01,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:01,061 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 17:54:01,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:01,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:54:01,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:01,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:54:01,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:54:01,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:54:01,062 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 7 states. [2018-12-09 17:54:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:01,176 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-12-09 17:54:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:54:01,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-12-09 17:54:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:01,176 INFO L225 Difference]: With dead ends: 106 [2018-12-09 17:54:01,176 INFO L226 Difference]: Without dead ends: 106 [2018-12-09 17:54:01,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:54:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-09 17:54:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-09 17:54:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 17:54:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-09 17:54:01,179 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 61 [2018-12-09 17:54:01,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:01,179 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-09 17:54:01,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:54:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-09 17:54:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 17:54:01,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:01,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:54:01,180 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:54:01,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash -124859677, now seen corresponding path program 1 times [2018-12-09 17:54:01,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:01,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:01,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 17:54:01,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:01,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 17:54:01,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:01,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 17:54:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 17:54:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-09 17:54:01,266 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 14 states. [2018-12-09 17:54:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:01,519 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-12-09 17:54:01,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 17:54:01,519 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-12-09 17:54:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:01,519 INFO L225 Difference]: With dead ends: 105 [2018-12-09 17:54:01,519 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 17:54:01,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-12-09 17:54:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 17:54:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-09 17:54:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 17:54:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-09 17:54:01,521 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 61 [2018-12-09 17:54:01,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:01,521 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-09 17:54:01,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 17:54:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-09 17:54:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 17:54:01,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:01,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1] [2018-12-09 17:54:01,522 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:54:01,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:01,523 INFO L82 PathProgramCache]: Analyzing trace with hash 424317281, now seen corresponding path program 1 times [2018-12-09 17:54:01,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:01,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:01,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:01,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 17:54:01,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:01,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 17:54:01,657 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 17:54:01,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 17:54:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 17:54:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-12-09 17:54:01,657 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 15 states. [2018-12-09 17:54:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:01,928 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-12-09 17:54:01,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 17:54:01,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-12-09 17:54:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:01,928 INFO L225 Difference]: With dead ends: 104 [2018-12-09 17:54:01,928 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 17:54:01,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2018-12-09 17:54:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 17:54:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-09 17:54:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 17:54:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-09 17:54:01,930 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 62 [2018-12-09 17:54:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:01,930 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-09 17:54:01,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 17:54:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-09 17:54:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 17:54:01,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:01,931 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, 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 17:54:01,931 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err0REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION]=== [2018-12-09 17:54:01,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:01,931 INFO L82 PathProgramCache]: Analyzing trace with hash -109549283, now seen corresponding path program 1 times [2018-12-09 17:54:01,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 17:54:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:01,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:01,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 17:54:01,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 17:54:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:02,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:54:02,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 17:54:02,834 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-12-09 17:54:02,834 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [8], [11], [16], [17], [18], [19], [21], [24], [36], [37], [40], [44], [45], [46], [47], [50], [53], [56], [59], [60], [63], [65], [66], [67], [68], [69], [72], [73], [76], [84], [87], [89], [91], [92], [95], [107], [108], [109], [110], [111], [112], [113], [115], [116], [117], [118], [119], [120], [121], [123], [124], [125] [2018-12-09 17:54:02,836 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 17:54:02,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 17:54:02,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 17:54:02,882 INFO L272 AbstractInterpreter]: Visited 56 different actions 56 times. Never merged. Never widened. Performed 535 root evaluator evaluations with a maximum evaluation depth of 6. Performed 535 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-12-09 17:54:02,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:02,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 17:54:02,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 17:54:02,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:54:02,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:02,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 17:54:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:02,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:54:02,932 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 12 treesize of output 15 [2018-12-09 17:54:02,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:02,945 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:54:02,948 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 15 treesize of output 14 [2018-12-09 17:54:02,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:02,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:02,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:02,972 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 17 treesize of output 24 [2018-12-09 17:54:02,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 17:54:02,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:03,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:03,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:54:03,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:93 [2018-12-09 17:54:03,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-12-09 17:54:03,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2018-12-09 17:54:03,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,159 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 31 treesize of output 29 [2018-12-09 17:54:03,162 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 17:54:03,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,168 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,183 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 24 treesize of output 22 [2018-12-09 17:54:03,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 17:54:03,184 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,190 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,204 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 25 [2018-12-09 17:54:03,206 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 17:54:03,206 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,210 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,222 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 18 [2018-12-09 17:54:03,224 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 17:54:03,224 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,227 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,235 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:75, output treesize:13 [2018-12-09 17:54:03,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:54:03,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:54:03,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:54:03,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:54:03,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-09 17:54:03,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 19 [2018-12-09 17:54:03,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 17:54:03,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 21 treesize of output 19 [2018-12-09 17:54:03,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 17:54:03,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-12-09 17:54:03,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2018-12-09 17:54:03,704 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 41 treesize of output 46 [2018-12-09 17:54:03,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,724 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,735 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 4 case distinctions, treesize of input 36 treesize of output 67 [2018-12-09 17:54:03,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-09 17:54:03,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:03,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 71 [2018-12-09 17:54:03,803 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 64 treesize of output 69 [2018-12-09 17:54:03,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 90 [2018-12-09 17:54:03,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 17:54:03,860 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:03,861 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:54:03,862 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:54:03,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 63 [2018-12-09 17:54:03,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,867 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2018-12-09 17:54:03,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,874 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,876 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:54:03,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 [2018-12-09 17:54:03,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:03,882 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 52 treesize of output 63 [2018-12-09 17:54:03,882 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,890 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:03,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:03,919 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:58, output treesize:165 [2018-12-09 17:54:04,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:04,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:04,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:04,225 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2018-12-09 17:54:04,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:04,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:04,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:04,258 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 88 [2018-12-09 17:54:04,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2018-12-09 17:54:04,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-12-09 17:54:04,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 77 [2018-12-09 17:54:04,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 17:54:04,325 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,334 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,363 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 88 treesize of output 84 [2018-12-09 17:54:04,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 15 treesize of output 19 [2018-12-09 17:54:04,366 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,416 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 81 treesize of output 77 [2018-12-09 17:54:04,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 17:54:04,418 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,428 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:04,450 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:191, output treesize:141 [2018-12-09 17:54:04,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:54:04,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:54:04,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:04,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 17:54:05,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:54:05,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 89 [2018-12-09 17:54:05,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2018-12-09 17:54:05,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,088 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 80 [2018-12-09 17:54:05,092 INFO L267 ElimStorePlain]: Start of recursive call 4: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-12-09 17:54:05,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 8 xjuncts. [2018-12-09 17:54:05,283 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 76 treesize of output 62 [2018-12-09 17:54:05,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-12-09 17:54:05,291 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 17:54:05,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 17:54:05,299 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,304 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 17:54:05,306 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 76 treesize of output 62 [2018-12-09 17:54:05,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-12-09 17:54:05,317 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 17:54:05,324 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 17:54:05,324 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,329 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:54:05,331 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 70 treesize of output 60 [2018-12-09 17:54:05,332 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 17:54:05,332 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,350 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 33 treesize of output 44 [2018-12-09 17:54:05,351 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:05,368 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:05,369 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 70 treesize of output 56 [2018-12-09 17:54:05,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,379 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 51 [2018-12-09 17:54:05,380 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:05,399 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 30 treesize of output 25 [2018-12-09 17:54:05,399 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-12-09 17:54:05,401 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,411 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:05,414 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 58 treesize of output 44 [2018-12-09 17:54:05,415 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 17:54:05,415 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,436 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 60 [2018-12-09 17:54:05,437 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 17:54:05,459 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-09 17:54:05,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 76 treesize of output 66 [2018-12-09 17:54:05,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-12-09 17:54:05,469 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:54:05,477 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 17:54:05,478 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,482 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:54:05,484 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 70 treesize of output 60 [2018-12-09 17:54:05,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,495 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 49 [2018-12-09 17:54:05,496 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:05,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-12-09 17:54:05,516 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,517 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 25 treesize of output 20 [2018-12-09 17:54:05,518 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,527 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:05,530 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 70 treesize of output 56 [2018-12-09 17:54:05,531 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 17:54:05,531 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:05,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:05,549 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 33 treesize of output 46 [2018-12-09 17:54:05,550 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:05,565 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-09 17:54:05,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 22 dim-0 vars, and 15 xjuncts. [2018-12-09 17:54:05,653 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 3 variables, input treesize:153, output treesize:357 [2018-12-09 17:54:06,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 17:54:06,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:54:06,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,032 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 17:54:06,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-12-09 17:54:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 17:54:06,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 17:54:06,308 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 18 treesize of output 13 [2018-12-09 17:54:06,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-12-09 17:54:06,511 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 9 treesize of output 7 [2018-12-09 17:54:06,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-09 17:54:06,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:06,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:45 [2018-12-09 17:54:06,769 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 19 treesize of output 13 [2018-12-09 17:54:06,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-12-09 17:54:06,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:06,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:73 [2018-12-09 17:54:06,849 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 48 treesize of output 36 [2018-12-09 17:54:06,851 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 36 treesize of output 16 [2018-12-09 17:54:06,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,857 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 17:54:06,859 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 7 [2018-12-09 17:54:06,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:12 [2018-12-09 17:54:06,926 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 7 treesize of output 5 [2018-12-09 17:54:06,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 17:54:06,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:06,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:06,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:25 [2018-12-09 17:54:08,160 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 84 treesize of output 66 [2018-12-09 17:54:08,176 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 50 treesize of output 39 [2018-12-09 17:54:08,178 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:54:08,178 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 39 treesize of output 45 [2018-12-09 17:54:08,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,184 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 17:54:08,186 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:54:08,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 17:54:08,186 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,202 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 35 treesize of output 27 [2018-12-09 17:54:08,203 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 7 [2018-12-09 17:54:08,204 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,206 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,207 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 49 treesize of output 37 [2018-12-09 17:54:08,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 34 treesize of output 18 [2018-12-09 17:54:08,228 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,229 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 14 [2018-12-09 17:54:08,230 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,231 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 32 treesize of output 14 [2018-12-09 17:54:08,231 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,232 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 32 treesize of output 18 [2018-12-09 17:54:08,232 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,242 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:08,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:08,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 84 treesize of output 66 [2018-12-09 17:54:08,275 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 17:54:08,276 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:54:08,277 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 28 [2018-12-09 17:54:08,277 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,281 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,283 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 50 treesize of output 39 [2018-12-09 17:54:08,285 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 39 treesize of output 38 [2018-12-09 17:54:08,285 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,289 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,302 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 42 treesize of output 34 [2018-12-09 17:54:08,324 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 17:54:08,324 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,326 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 29 treesize of output 15 [2018-12-09 17:54:08,326 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,327 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 27 treesize of output 11 [2018-12-09 17:54:08,327 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,337 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:08,338 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 49 treesize of output 37 [2018-12-09 17:54:08,355 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 27 treesize of output 11 [2018-12-09 17:54:08,355 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,356 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 29 treesize of output 15 [2018-12-09 17:54:08,357 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,366 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:08,367 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 35 treesize of output 27 [2018-12-09 17:54:08,369 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 7 [2018-12-09 17:54:08,369 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,371 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:08,387 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:08,408 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 5 xjuncts. [2018-12-09 17:54:08,408 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 4 variables, input treesize:189, output treesize:90 [2018-12-09 17:54:08,962 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-09 17:54:09,474 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 89 [2018-12-09 17:54:09,477 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 117 treesize of output 95 [2018-12-09 17:54:09,678 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 17:54:09,680 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:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:223) 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:383) 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 17:54:09,687 INFO L168 Benchmark]: Toolchain (without parser) took 33447.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.0 MB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -242.5 MB). Peak memory consumption was 485.6 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:09,688 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:54:09,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:09,689 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 17:54:09,689 INFO L168 Benchmark]: Boogie Preprocessor took 20.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:09,689 INFO L168 Benchmark]: RCFGBuilder took 264.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:09,689 INFO L168 Benchmark]: TraceAbstraction took 32819.52 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -145.8 MB). Peak memory consumption was 473.9 MB. Max. memory is 11.5 GB. [2018-12-09 17:54:09,691 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -133.6 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.67 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 264.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32819.52 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -145.8 MB). Peak memory consumption was 473.9 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:347) 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 17:54:10,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 17:54:10,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 17:54:10,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 17:54:10,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 17:54:10,931 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 17:54:10,932 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 17:54:10,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 17:54:10,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 17:54:10,934 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 17:54:10,934 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 17:54:10,934 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 17:54:10,935 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 17:54:10,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 17:54:10,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 17:54:10,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 17:54:10,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 17:54:10,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 17:54:10,938 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 17:54:10,939 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 17:54:10,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 17:54:10,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 17:54:10,941 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 17:54:10,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 17:54:10,941 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 17:54:10,942 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 17:54:10,942 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 17:54:10,943 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 17:54:10,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 17:54:10,943 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 17:54:10,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 17:54:10,944 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 17:54:10,944 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 17:54:10,944 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 17:54:10,945 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 17:54:10,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 17:54:10,945 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-09 17:54:10,952 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 17:54:10,953 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 17:54:10,953 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 17:54:10,953 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 17:54:10,953 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 17:54:10,954 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 17:54:10,954 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 17:54:10,954 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 17:54:10,954 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 17:54:10,954 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 17:54:10,954 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 17:54:10,954 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 17:54:10,954 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 17:54:10,955 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 17:54:10,956 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 17:54:10,956 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 17:54:10,956 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 17:54:10,957 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 17:54:10,957 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_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 -> 976e1955e162f3b4e872a15f7e9a64e265f0afc5 [2018-12-09 17:54:10,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 17:54:10,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 17:54:10,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 17:54:10,988 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 17:54:10,988 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 17:54:10,989 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2018-12-09 17:54:11,033 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data/257a0bf9c/4477f527d188489db484692178f7c248/FLAGc161081f4 [2018-12-09 17:54:11,458 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 17:54:11,458 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/sv-benchmarks/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2018-12-09 17:54:11,465 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data/257a0bf9c/4477f527d188489db484692178f7c248/FLAGc161081f4 [2018-12-09 17:54:11,474 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/data/257a0bf9c/4477f527d188489db484692178f7c248 [2018-12-09 17:54:11,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 17:54:11,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 17:54:11,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 17:54:11,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 17:54:11,479 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 17:54:11,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d255691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11, skipping insertion in model container [2018-12-09 17:54:11,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 17:54:11,515 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 17:54:11,737 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:54:11,749 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 17:54:11,825 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 17:54:11,859 INFO L195 MainTranslator]: Completed translation [2018-12-09 17:54:11,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11 WrapperNode [2018-12-09 17:54:11,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 17:54:11,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 17:54:11,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 17:54:11,860 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 17:54:11,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 17:54:11,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 17:54:11,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 17:54:11,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 17:54:11,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... [2018-12-09 17:54:11,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 17:54:11,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 17:54:11,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 17:54:11,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 17:54:11,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:54:11,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 17:54:11,932 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-09 17:54:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-09 17:54:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-09 17:54:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-09 17:54:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-09 17:54:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-09 17:54:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-12-09 17:54:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-12-09 17:54:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-09 17:54:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-09 17:54:11,933 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2018-12-09 17:54:11,933 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2018-12-09 17:54:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 17:54:11,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 17:54:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 17:54:11,934 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 17:54:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 17:54:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 17:54:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 17:54:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 17:54:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-12-09 17:54:11,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-12-09 17:54:11,934 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2018-12-09 17:54:11,934 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2018-12-09 17:54:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-09 17:54:11,935 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-09 17:54:11,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 17:54:11,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 17:54:12,243 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 17:54:12,243 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 17:54:12,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:12 BoogieIcfgContainer [2018-12-09 17:54:12,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 17:54:12,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 17:54:12,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 17:54:12,245 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 17:54:12,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:54:11" (1/3) ... [2018-12-09 17:54:12,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9652c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:54:12, skipping insertion in model container [2018-12-09 17:54:12,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:54:11" (2/3) ... [2018-12-09 17:54:12,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9652c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:54:12, skipping insertion in model container [2018-12-09 17:54:12,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:12" (3/3) ... [2018-12-09 17:54:12,247 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_true-valid-memsafety.i [2018-12-09 17:54:12,253 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 17:54:12,257 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-12-09 17:54:12,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2018-12-09 17:54:12,283 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 17:54:12,283 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 17:54:12,284 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 17:54:12,284 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 17:54:12,284 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 17:54:12,284 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 17:54:12,284 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 17:54:12,284 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 17:54:12,284 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 17:54:12,295 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states. [2018-12-09 17:54:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 17:54:12,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:12,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:54:12,303 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:54:12,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:12,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1627156754, now seen corresponding path program 1 times [2018-12-09 17:54:12,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:54:12,310 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:54:12,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:12,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:54:12,423 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 12 treesize of output 15 [2018-12-09 17:54:12,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:12,442 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:54:12,448 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:12,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:12,463 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 17 treesize of output 24 [2018-12-09 17:54:12,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:54:12,504 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 15 treesize of output 14 [2018-12-09 17:54:12,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:12,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:12,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:12,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-09 17:54:12,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:71 [2018-12-09 17:54:12,650 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 9 treesize of output 7 [2018-12-09 17:54:12,653 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 17:54:12,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:12,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:12,656 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 17:54:12,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2018-12-09 17:54:12,678 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 17:54:12,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:12,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:12,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2018-12-09 17:54:12,708 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 17:54:12,708 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:54:12,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:12,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:54:12,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:54:12,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:54:12,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:54:12,724 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 7 states. [2018-12-09 17:54:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:21,740 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2018-12-09 17:54:21,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:54:21,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-09 17:54:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:21,751 INFO L225 Difference]: With dead ends: 204 [2018-12-09 17:54:21,751 INFO L226 Difference]: Without dead ends: 191 [2018-12-09 17:54:21,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:54:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-09 17:54:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 107. [2018-12-09 17:54:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 17:54:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2018-12-09 17:54:21,789 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2018-12-09 17:54:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:21,790 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2018-12-09 17:54:21,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:54:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2018-12-09 17:54:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 17:54:21,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:21,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:54:21,791 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:54:21,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:21,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1627156755, now seen corresponding path program 1 times [2018-12-09 17:54:21,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:54:21,792 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:54:21,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:21,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:54:21,875 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 17:54:21,875 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:54:21,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:21,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:54:21,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:54:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:54:21,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:54:21,878 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 5 states. [2018-12-09 17:54:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:54:21,893 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-09 17:54:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:54:21,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-09 17:54:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:54:21,895 INFO L225 Difference]: With dead ends: 108 [2018-12-09 17:54:21,895 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 17:54:21,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:54:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 17:54:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-12-09 17:54:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 17:54:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-09 17:54:21,903 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 17 [2018-12-09 17:54:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:54:21,903 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-09 17:54:21,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:54:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-09 17:54:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 17:54:21,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:54:21,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:54:21,904 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:54:21,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:54:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash -115653580, now seen corresponding path program 1 times [2018-12-09 17:54:21,905 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:54:21,905 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:54:21,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:54:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:54:21,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:54:21,982 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 12 treesize of output 15 [2018-12-09 17:54:21,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:21,995 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:54:22,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:22,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:22,016 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 17 treesize of output 24 [2018-12-09 17:54:22,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:54:22,054 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 15 treesize of output 14 [2018-12-09 17:54:22,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:22,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:54:22,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 17:54:22,169 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 17:54:22,170 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:54:22,202 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:34, output treesize:110 [2018-12-09 17:54:22,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-09 17:54:22,282 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 17:54:22,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,312 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 30 treesize of output 28 [2018-12-09 17:54:22,314 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 17:54:22,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:22,338 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:43 [2018-12-09 17:54:22,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:22,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:22,383 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 27 treesize of output 19 [2018-12-09 17:54:22,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-09 17:54:22,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-09 17:54:22,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-09 17:54:22,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:54:22,459 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:10 [2018-12-09 17:54:26,980 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-09 17:54:26,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:26,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:26,993 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 24 [2018-12-09 17:54:26,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:27,052 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 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-09 17:54:27,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 17:54:27,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:27,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:27,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:54:27,122 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-09 17:54:27,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:27,182 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 23 treesize of output 22 [2018-12-09 17:54:27,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:54:27,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:54:27,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:65, output treesize:28 [2018-12-09 17:54:28,563 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 17:54:28,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:54:28,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:54:28,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:54:28,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:54:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:54:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=50, Unknown=4, NotChecked=0, Total=72 [2018-12-09 17:54:28,566 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 9 states. [2018-12-09 17:54:41,503 WARN L180 SmtUtils]: Spent 3.70 s on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2018-12-09 17:55:49,469 WARN L180 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-12-09 17:56:21,396 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 17:56:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:56:36,027 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2018-12-09 17:56:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 17:56:36,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-09 17:56:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:56:36,029 INFO L225 Difference]: With dead ends: 188 [2018-12-09 17:56:36,029 INFO L226 Difference]: Without dead ends: 188 [2018-12-09 17:56:36,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=86, Invalid=195, Unknown=25, NotChecked=0, Total=306 [2018-12-09 17:56:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-09 17:56:36,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 115. [2018-12-09 17:56:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-09 17:56:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-12-09 17:56:36,035 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 17 [2018-12-09 17:56:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:56:36,035 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-12-09 17:56:36,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:56:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-12-09 17:56:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 17:56:36,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:56:36,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:56:36,036 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:56:36,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:56:36,036 INFO L82 PathProgramCache]: Analyzing trace with hash -871985669, now seen corresponding path program 1 times [2018-12-09 17:56:36,036 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:56:36,036 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:56:36,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:56:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:56:36,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:56:36,118 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 9 treesize of output 7 [2018-12-09 17:56:36,120 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 17:56:36,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:36,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:56:36,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:56:36,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2018-12-09 17:56:36,173 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 22 treesize of output 16 [2018-12-09 17:56:36,175 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 17:56:36,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:36,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:56:36,180 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 17:56:36,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:5 [2018-12-09 17:56:36,214 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 17:56:36,214 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:56:36,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:56:36,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:56:36,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:56:36,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:56:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:56:36,217 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 9 states. [2018-12-09 17:56:36,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:56:36,948 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-12-09 17:56:36,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 17:56:36,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-12-09 17:56:36,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:56:36,949 INFO L225 Difference]: With dead ends: 143 [2018-12-09 17:56:36,949 INFO L226 Difference]: Without dead ends: 143 [2018-12-09 17:56:36,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-12-09 17:56:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-09 17:56:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 114. [2018-12-09 17:56:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 17:56:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-12-09 17:56:36,954 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 20 [2018-12-09 17:56:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:56:36,955 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-12-09 17:56:36,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:56:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-12-09 17:56:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 17:56:36,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:56:36,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:56:36,955 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:56:36,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:56:36,955 INFO L82 PathProgramCache]: Analyzing trace with hash -871985668, now seen corresponding path program 1 times [2018-12-09 17:56:36,956 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:56:36,956 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:56:36,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:56:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:56:37,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:56:37,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 17:56:37,058 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 17:56:37,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:37,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:56:37,098 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 12 treesize of output 15 [2018-12-09 17:56:37,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:37,110 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:56:37,115 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 15 treesize of output 14 [2018-12-09 17:56:37,116 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:37,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:37,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:37,154 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 17 treesize of output 24 [2018-12-09 17:56:37,154 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-09 17:56:37,176 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:56:37,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:56:37,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:56:37,223 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:57, output treesize:179 [2018-12-09 17:56:37,353 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-09 17:56:37,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2018-12-09 17:56:37,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:37,440 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 49 treesize of output 42 [2018-12-09 17:56:37,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:37,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:56:37,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:119, output treesize:42 [2018-12-09 17:56:41,675 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 17:56:41,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:41,690 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 64 treesize of output 67 [2018-12-09 17:56:41,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:41,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:41,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:41,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:41,795 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2018-12-09 17:56:41,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:41,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:41,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:56:41,885 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 64 treesize of output 56 [2018-12-09 17:56:41,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:41,985 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 2 case distinctions, treesize of input 56 treesize of output 59 [2018-12-09 17:56:41,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 17:56:42,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:56:42,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:129, output treesize:92 [2018-12-09 17:56:44,033 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 22 treesize of output 16 [2018-12-09 17:56:44,035 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 17:56:44,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:44,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:56:44,049 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 22 treesize of output 16 [2018-12-09 17:56:44,051 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 17:56:44,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:56:44,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:56:44,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:56:44,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:9 [2018-12-09 17:56:44,128 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 17:56:44,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:56:44,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:56:44,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 17:56:44,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 17:56:44,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 17:56:44,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=87, Unknown=3, NotChecked=0, Total=110 [2018-12-09 17:56:44,131 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 11 states. [2018-12-09 17:56:52,486 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-09 17:57:05,042 WARN L180 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2018-12-09 17:57:18,802 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2018-12-09 17:57:25,696 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 73 [2018-12-09 17:57:33,008 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2018-12-09 17:57:41,926 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-12-09 17:57:48,095 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-12-09 17:58:23,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:23,126 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2018-12-09 17:58:23,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 17:58:23,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-09 17:58:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:23,128 INFO L225 Difference]: With dead ends: 133 [2018-12-09 17:58:23,128 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 17:58:23,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=78, Invalid=249, Unknown=15, NotChecked=0, Total=342 [2018-12-09 17:58:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 17:58:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2018-12-09 17:58:23,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-09 17:58:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-12-09 17:58:23,132 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2018-12-09 17:58:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:23,132 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-12-09 17:58:23,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 17:58:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-12-09 17:58:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:58:23,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:23,133 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] [2018-12-09 17:58:23,133 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:23,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1261751943, now seen corresponding path program 1 times [2018-12-09 17:58:23,133 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:23,133 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:58:23,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:23,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:23,210 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 17:58:23,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:23,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:23,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 17:58:23,261 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 17:58:23,261 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:23,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:23,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:58:23,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:58:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:58:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:58:23,264 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 9 states. [2018-12-09 17:58:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:23,728 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2018-12-09 17:58:23,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 17:58:23,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-09 17:58:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:23,729 INFO L225 Difference]: With dead ends: 111 [2018-12-09 17:58:23,729 INFO L226 Difference]: Without dead ends: 111 [2018-12-09 17:58:23,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:58:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-09 17:58:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-09 17:58:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-09 17:58:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-12-09 17:58:23,732 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 21 [2018-12-09 17:58:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:23,733 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-12-09 17:58:23,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:58:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-12-09 17:58:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:58:23,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:23,733 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] [2018-12-09 17:58:23,733 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:23,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1261751942, now seen corresponding path program 1 times [2018-12-09 17:58:23,734 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:23,734 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:23,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:23,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:23,825 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 17:58:23,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:23,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:23,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 17:58:23,904 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 17:58:23,904 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:23,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:23,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 17:58:23,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 17:58:23,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 17:58:23,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:58:23,907 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 10 states. [2018-12-09 17:58:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:24,468 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2018-12-09 17:58:24,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:58:24,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-09 17:58:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:24,470 INFO L225 Difference]: With dead ends: 109 [2018-12-09 17:58:24,470 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 17:58:24,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:58:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 17:58:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-09 17:58:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 17:58:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-12-09 17:58:24,475 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 21 [2018-12-09 17:58:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:24,475 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-12-09 17:58:24,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 17:58:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-12-09 17:58:24,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:58:24,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:24,476 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] [2018-12-09 17:58:24,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:24,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:24,476 INFO L82 PathProgramCache]: Analyzing trace with hash 755715794, now seen corresponding path program 1 times [2018-12-09 17:58:24,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:24,476 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:58:24,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:24,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:24,552 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 12 treesize of output 15 [2018-12-09 17:58:24,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:24,563 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:58:24,567 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 15 treesize of output 14 [2018-12-09 17:58:24,567 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:24,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:24,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:24,600 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 17 treesize of output 24 [2018-12-09 17:58:24,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 17:58:24,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:24,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:24,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:58:24,703 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:92 [2018-12-09 17:58:24,748 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 17:58:24,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:24,762 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 17 treesize of output 13 [2018-12-09 17:58:24,765 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:24,766 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 13 treesize of output 6 [2018-12-09 17:58:24,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:24,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:24,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:24,770 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-12-09 17:58:24,791 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 18 [2018-12-09 17:58:24,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:24,796 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 18 treesize of output 10 [2018-12-09 17:58:24,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:24,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:24,805 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 17:58:24,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-09 17:58:24,822 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 17:58:24,822 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:24,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:24,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:58:24,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:58:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:58:24,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:58:24,825 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 7 states. [2018-12-09 17:58:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:25,596 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-12-09 17:58:25,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 17:58:25,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-09 17:58:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:25,598 INFO L225 Difference]: With dead ends: 141 [2018-12-09 17:58:25,598 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 17:58:25,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-09 17:58:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 17:58:25,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2018-12-09 17:58:25,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-09 17:58:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-12-09 17:58:25,604 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 21 [2018-12-09 17:58:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:25,604 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-12-09 17:58:25,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:58:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-12-09 17:58:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:58:25,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:25,605 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] [2018-12-09 17:58:25,605 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:25,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash 755715795, now seen corresponding path program 1 times [2018-12-09 17:58:25,606 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:25,606 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:25,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:25,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:25,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 17:58:25,696 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 17:58:25,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,717 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 17:58:25,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:46 [2018-12-09 17:58:25,758 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 17:58:25,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,778 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 17 treesize of output 13 [2018-12-09 17:58:25,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:25,781 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 13 treesize of output 6 [2018-12-09 17:58:25,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,796 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 17 treesize of output 13 [2018-12-09 17:58:25,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:25,799 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 13 treesize of output 6 [2018-12-09 17:58:25,800 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,801 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,806 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:50, output treesize:13 [2018-12-09 17:58:25,831 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 22 treesize of output 16 [2018-12-09 17:58:25,834 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 17:58:25,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,846 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 22 treesize of output 16 [2018-12-09 17:58:25,848 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 17:58:25,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:25,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:9 [2018-12-09 17:58:25,878 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 17:58:25,878 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:25,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:25,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 17:58:25,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:58:25,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:58:25,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:58:25,881 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 7 states. [2018-12-09 17:58:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:26,524 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2018-12-09 17:58:26,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:58:26,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-09 17:58:26,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:26,525 INFO L225 Difference]: With dead ends: 152 [2018-12-09 17:58:26,525 INFO L226 Difference]: Without dead ends: 150 [2018-12-09 17:58:26,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:58:26,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-09 17:58:26,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2018-12-09 17:58:26,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-09 17:58:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2018-12-09 17:58:26,529 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 21 [2018-12-09 17:58:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:26,529 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2018-12-09 17:58:26,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:58:26,530 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2018-12-09 17:58:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 17:58:26,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:26,530 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] [2018-12-09 17:58:26,530 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:26,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash 626633076, now seen corresponding path program 1 times [2018-12-09 17:58:26,531 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:26,531 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:58:26,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:26,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:26,573 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 17:58:26,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:26,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:26,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:58:26,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 17:58:26,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 17:58:26,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:58:26,575 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 5 states. [2018-12-09 17:58:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:26,582 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-12-09 17:58:26,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 17:58:26,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-09 17:58:26,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:26,583 INFO L225 Difference]: With dead ends: 126 [2018-12-09 17:58:26,583 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 17:58:26,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 17:58:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 17:58:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-12-09 17:58:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-09 17:58:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-09 17:58:26,586 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 21 [2018-12-09 17:58:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:26,586 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-09 17:58:26,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 17:58:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-09 17:58:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 17:58:26,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:26,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:26,587 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:26,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:26,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1362839012, now seen corresponding path program 1 times [2018-12-09 17:58:26,587 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:26,587 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:26,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:26,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:26,678 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 9 treesize of output 7 [2018-12-09 17:58:26,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 17:58:26,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:26,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:26,680 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 17:58:26,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2018-12-09 17:58:26,699 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 17:58:26,699 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:26,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:26,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 17:58:26,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 17:58:26,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 17:58:26,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 17:58:26,702 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 6 states. [2018-12-09 17:58:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:27,527 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-12-09 17:58:27,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 17:58:27,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-12-09 17:58:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:27,528 INFO L225 Difference]: With dead ends: 133 [2018-12-09 17:58:27,528 INFO L226 Difference]: Without dead ends: 133 [2018-12-09 17:58:27,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 17:58:27,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-09 17:58:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 123. [2018-12-09 17:58:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-09 17:58:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2018-12-09 17:58:27,530 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 23 [2018-12-09 17:58:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:27,531 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2018-12-09 17:58:27,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 17:58:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2018-12-09 17:58:27,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 17:58:27,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:27,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:27,532 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:27,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1362839011, now seen corresponding path program 1 times [2018-12-09 17:58:27,532 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:27,532 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:58:27,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:27,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:27,677 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 22 treesize of output 16 [2018-12-09 17:58:27,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 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-09 17:58:27,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:27,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:27,695 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 22 treesize of output 16 [2018-12-09 17:58:27,697 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 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-09 17:58:27,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:27,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:27,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:27,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:10 [2018-12-09 17:58:27,772 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 17:58:27,772 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:27,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:27,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:58:27,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:58:27,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:58:27,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:58:27,775 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand 9 states. [2018-12-09 17:58:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:28,547 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-12-09 17:58:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:58:28,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-09 17:58:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:28,548 INFO L225 Difference]: With dead ends: 130 [2018-12-09 17:58:28,548 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 17:58:28,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-09 17:58:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 17:58:28,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2018-12-09 17:58:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-09 17:58:28,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-09 17:58:28,551 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 23 [2018-12-09 17:58:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:28,551 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-09 17:58:28,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:58:28,551 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-09 17:58:28,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 17:58:28,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:28,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:28,552 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:28,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:28,552 INFO L82 PathProgramCache]: Analyzing trace with hash -992923394, now seen corresponding path program 1 times [2018-12-09 17:58:28,553 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:28,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:28,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:28,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:28,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 17:58:28,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:28,636 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:58:28,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:28,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:28,652 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 17 treesize of output 24 [2018-12-09 17:58:28,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:58:28,686 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 15 treesize of output 14 [2018-12-09 17:58:28,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:28,709 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:28,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:28,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:58:28,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:92 [2018-12-09 17:58:28,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 17:58:28,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:28,811 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 17 treesize of output 13 [2018-12-09 17:58:28,813 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:28,814 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 13 treesize of output 6 [2018-12-09 17:58:28,814 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:28,815 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:28,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:28,818 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-12-09 17:58:28,837 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 18 [2018-12-09 17:58:28,840 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:28,841 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 18 treesize of output 10 [2018-12-09 17:58:28,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:28,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:28,848 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 17:58:28,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:5 [2018-12-09 17:58:28,879 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 17:58:28,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:28,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:28,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 17:58:28,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 17:58:28,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 17:58:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 17:58:28,881 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 9 states. [2018-12-09 17:58:29,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:29,890 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-12-09 17:58:29,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 17:58:29,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-09 17:58:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:29,892 INFO L225 Difference]: With dead ends: 141 [2018-12-09 17:58:29,892 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 17:58:29,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2018-12-09 17:58:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 17:58:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2018-12-09 17:58:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-09 17:58:29,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-12-09 17:58:29,895 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 26 [2018-12-09 17:58:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:29,896 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-12-09 17:58:29,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 17:58:29,896 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-12-09 17:58:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 17:58:29,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:29,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:29,897 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:29,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:29,897 INFO L82 PathProgramCache]: Analyzing trace with hash -992923393, now seen corresponding path program 1 times [2018-12-09 17:58:29,897 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:29,897 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:29,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:29,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:29,987 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 17 treesize of output 13 [2018-12-09 17:58:29,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:29,991 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 13 treesize of output 6 [2018-12-09 17:58:29,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:29,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,003 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 17 treesize of output 13 [2018-12-09 17:58:30,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 17:58:30,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:10 [2018-12-09 17:58:30,025 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 18 [2018-12-09 17:58:30,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,028 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 18 treesize of output 10 [2018-12-09 17:58:30,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,043 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 18 [2018-12-09 17:58:30,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,046 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 18 treesize of output 10 [2018-12-09 17:58:30,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,049 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:10 [2018-12-09 17:58:30,078 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 17:58:30,079 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:30,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:30,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 17:58:30,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 17:58:30,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 17:58:30,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 17:58:30,081 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 7 states. [2018-12-09 17:58:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:30,532 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-12-09 17:58:30,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:58:30,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-09 17:58:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:30,532 INFO L225 Difference]: With dead ends: 118 [2018-12-09 17:58:30,532 INFO L226 Difference]: Without dead ends: 118 [2018-12-09 17:58:30,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:58:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-09 17:58:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-09 17:58:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-09 17:58:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-12-09 17:58:30,535 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 26 [2018-12-09 17:58:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:30,535 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-12-09 17:58:30,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 17:58:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-12-09 17:58:30,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 17:58:30,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:30,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:30,535 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:30,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:30,536 INFO L82 PathProgramCache]: Analyzing trace with hash -787755985, now seen corresponding path program 1 times [2018-12-09 17:58:30,536 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:30,536 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:30,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:30,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:30,603 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 12 treesize of output 15 [2018-12-09 17:58:30,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,616 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:58:30,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,630 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 17 treesize of output 24 [2018-12-09 17:58:30,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:58:30,662 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 15 treesize of output 14 [2018-12-09 17:58:30,663 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:30,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:30,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:58:30,735 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:92 [2018-12-09 17:58:30,775 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 17:58:30,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,789 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 17 treesize of output 13 [2018-12-09 17:58:30,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,793 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 13 treesize of output 6 [2018-12-09 17:58:30,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,797 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-12-09 17:58:30,815 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 17:58:30,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,827 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 17 treesize of output 13 [2018-12-09 17:58:30,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,830 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 13 treesize of output 6 [2018-12-09 17:58:30,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,832 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,835 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:7 [2018-12-09 17:58:30,877 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 17 treesize of output 13 [2018-12-09 17:58:30,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:30,881 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 13 treesize of output 6 [2018-12-09 17:58:30,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:30,886 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 17:58:30,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:5 [2018-12-09 17:58:30,918 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 17:58:30,918 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 17:58:30,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 17:58:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 17:58:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-09 17:58:30,920 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 11 states. [2018-12-09 17:58:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:31,950 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-09 17:58:31,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 17:58:31,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-12-09 17:58:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:31,951 INFO L225 Difference]: With dead ends: 141 [2018-12-09 17:58:31,951 INFO L226 Difference]: Without dead ends: 141 [2018-12-09 17:58:31,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2018-12-09 17:58:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-09 17:58:31,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 126. [2018-12-09 17:58:31,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-09 17:58:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-12-09 17:58:31,954 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2018-12-09 17:58:31,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:31,954 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-12-09 17:58:31,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 17:58:31,954 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-12-09 17:58:31,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 17:58:31,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:31,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:31,955 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:31,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:31,955 INFO L82 PathProgramCache]: Analyzing trace with hash -787755984, now seen corresponding path program 1 times [2018-12-09 17:58:31,956 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:31,956 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:58:31,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:32,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:32,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 17:58:32,036 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 17:58:32,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,050 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 17:58:32,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:30 [2018-12-09 17:58:32,079 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 17:58:32,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,090 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 17 treesize of output 13 [2018-12-09 17:58:32,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:32,093 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 13 treesize of output 6 [2018-12-09 17:58:32,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,098 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:10 [2018-12-09 17:58:32,115 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 17 treesize of output 13 [2018-12-09 17:58:32,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:32,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 17:58:32,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:12 [2018-12-09 17:58:32,187 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 17 treesize of output 13 [2018-12-09 17:58:32,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:32,190 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 13 treesize of output 6 [2018-12-09 17:58:32,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:32,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-09 17:58:32,239 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 17:58:32,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:32,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:32,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 17:58:32,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 17:58:32,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 17:58:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-09 17:58:32,241 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 12 states. [2018-12-09 17:58:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:33,025 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-12-09 17:58:33,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 17:58:33,025 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-09 17:58:33,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:33,026 INFO L225 Difference]: With dead ends: 126 [2018-12-09 17:58:33,026 INFO L226 Difference]: Without dead ends: 107 [2018-12-09 17:58:33,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-12-09 17:58:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-09 17:58:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-09 17:58:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 17:58:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-12-09 17:58:33,028 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 28 [2018-12-09 17:58:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:33,028 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-12-09 17:58:33,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 17:58:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-12-09 17:58:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:58:33,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:33,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:33,029 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:33,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:33,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1950839153, now seen corresponding path program 1 times [2018-12-09 17:58:33,029 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:33,029 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:33,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:33,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:33,141 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 9 treesize of output 7 [2018-12-09 17:58:33,143 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 17:58:33,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,148 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 9 treesize of output 7 [2018-12-09 17:58:33,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 7 treesize of output 1 [2018-12-09 17:58:33,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,151 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-12-09 17:58:33,155 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 17:58:33,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-09 17:58:33,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:58:33,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:58:33,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,319 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 17:58:33,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-12-09 17:58:33,437 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 17 treesize of output 13 [2018-12-09 17:58:33,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 5 [2018-12-09 17:58:33,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:33,444 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 17:58:33,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-12-09 17:58:33,481 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 17:58:33,481 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:33,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:33,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 17:58:33,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 17:58:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 17:58:33,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-12-09 17:58:33,483 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 16 states. [2018-12-09 17:58:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:35,115 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-09 17:58:35,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 17:58:35,116 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-12-09 17:58:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:35,116 INFO L225 Difference]: With dead ends: 117 [2018-12-09 17:58:35,116 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 17:58:35,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2018-12-09 17:58:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 17:58:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-12-09 17:58:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 17:58:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2018-12-09 17:58:35,119 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 35 [2018-12-09 17:58:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:35,119 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2018-12-09 17:58:35,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 17:58:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2018-12-09 17:58:35,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 17:58:35,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:35,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:35,120 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:35,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1950839154, now seen corresponding path program 1 times [2018-12-09 17:58:35,121 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:58:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:35,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:35,254 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 9 treesize of output 7 [2018-12-09 17:58:35,256 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 17:58:35,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,261 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 9 treesize of output 7 [2018-12-09 17:58:35,262 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 17:58:35,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-12-09 17:58:35,281 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 17:58:35,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-09 17:58:35,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:58:35,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:58:35,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:58:35,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:58:35,443 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,455 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 17:58:35,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2018-12-09 17:58:35,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 17:58:35,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:58:35,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,612 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 17 treesize of output 13 [2018-12-09 17:58:35,613 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 5 [2018-12-09 17:58:35,614 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:35,619 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-09 17:58:35,660 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 17:58:35,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:35,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:35,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-09 17:58:35,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 17:58:35,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 17:58:35,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-09 17:58:35,663 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 16 states. [2018-12-09 17:58:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:37,471 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-09 17:58:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-09 17:58:37,472 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-12-09 17:58:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:37,472 INFO L225 Difference]: With dead ends: 102 [2018-12-09 17:58:37,472 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 17:58:37,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2018-12-09 17:58:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 17:58:37,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-09 17:58:37,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:58:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2018-12-09 17:58:37,475 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 35 [2018-12-09 17:58:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:37,475 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2018-12-09 17:58:37,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 17:58:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2018-12-09 17:58:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 17:58:37,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:37,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:37,476 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:37,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1221797440, now seen corresponding path program 1 times [2018-12-09 17:58:37,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:37,476 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:37,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:37,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:37,608 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 9 treesize of output 7 [2018-12-09 17:58:37,609 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 17:58:37,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,616 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 9 treesize of output 7 [2018-12-09 17:58:37,617 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 17:58:37,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-12-09 17:58:37,630 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 17:58:37,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-09 17:58:37,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:58:37,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:58:37,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:58:37,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:58:37,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,818 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 17:58:37,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-12-09 17:58:37,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-09 17:58:37,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-09 17:58:37,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,972 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 17 treesize of output 13 [2018-12-09 17:58:37,973 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 5 [2018-12-09 17:58:37,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:37,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-09 17:58:38,081 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 17:58:38,081 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:38,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:38,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 17:58:38,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 17:58:38,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 17:58:38,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-12-09 17:58:38,084 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 18 states. [2018-12-09 17:58:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:40,127 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-12-09 17:58:40,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 17:58:40,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-12-09 17:58:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:40,128 INFO L225 Difference]: With dead ends: 100 [2018-12-09 17:58:40,128 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 17:58:40,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-12-09 17:58:40,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 17:58:40,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-12-09 17:58:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:58:40,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2018-12-09 17:58:40,130 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 40 [2018-12-09 17:58:40,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:40,131 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2018-12-09 17:58:40,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 17:58:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2018-12-09 17:58:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 17:58:40,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:40,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:58:40,132 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:40,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1034005355, now seen corresponding path program 1 times [2018-12-09 17:58:40,132 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:40,132 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:58:40,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:40,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:40,328 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 12 treesize of output 15 [2018-12-09 17:58:40,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:40,339 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:58:40,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:40,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:40,354 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 17 treesize of output 24 [2018-12-09 17:58:40,354 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:58:40,380 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 15 treesize of output 14 [2018-12-09 17:58:40,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,398 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:40,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:40,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:58:40,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:128 [2018-12-09 17:58:40,488 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 9 treesize of output 7 [2018-12-09 17:58:40,489 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 17:58:40,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,497 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-12-09 17:58:40,519 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 17:58:40,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,535 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 17 treesize of output 13 [2018-12-09 17:58:40,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:40,538 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 13 treesize of output 6 [2018-12-09 17:58:40,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,543 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-12-09 17:58:40,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:58:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:58:40,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,780 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 17:58:40,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-09 17:58:40,847 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 21 treesize of output 16 [2018-12-09 17:58:40,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:40,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 17:58:40,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,896 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 17:58:40,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-12-09 17:58:40,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 17:58:40,982 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 17:58:40,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:40,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:41,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 49 [2018-12-09 17:58:41,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:41,085 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 2 case distinctions, treesize of input 35 treesize of output 44 [2018-12-09 17:58:41,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 17:58:41,200 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 38 treesize of output 37 [2018-12-09 17:58:41,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:41,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:58:41,312 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 2 xjuncts. [2018-12-09 17:58:41,312 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:49, output treesize:88 [2018-12-09 17:58:41,615 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-12-09 17:58:41,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:41,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-09 17:58:41,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:41,726 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 32 treesize of output 26 [2018-12-09 17:58:41,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:41,730 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 26 treesize of output 18 [2018-12-09 17:58:41,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:41,735 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:41,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:41,749 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:84, output treesize:56 [2018-12-09 17:58:41,868 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 25 treesize of output 24 [2018-12-09 17:58:41,871 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 5 [2018-12-09 17:58:41,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:41,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:41,888 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 17:58:41,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2018-12-09 17:58:42,109 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 42 treesize of output 27 [2018-12-09 17:58:42,111 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 17:58:42,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:42,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-09 17:58:42,117 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:42,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:42,122 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 17:58:42,122 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:7 [2018-12-09 17:58:42,261 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 17:58:42,261 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:42,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:42,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-12-09 17:58:42,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-09 17:58:42,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-09 17:58:42,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-12-09 17:58:42,264 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand 27 states. [2018-12-09 17:58:44,450 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-12-09 17:58:44,768 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-12-09 17:58:44,984 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-12-09 17:58:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:58:47,252 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-09 17:58:47,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 17:58:47,252 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2018-12-09 17:58:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:58:47,253 INFO L225 Difference]: With dead ends: 100 [2018-12-09 17:58:47,253 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 17:58:47,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=303, Invalid=2453, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 17:58:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 17:58:47,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-12-09 17:58:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:58:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2018-12-09 17:58:47,255 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 44 [2018-12-09 17:58:47,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:58:47,255 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2018-12-09 17:58:47,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-09 17:58:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2018-12-09 17:58:47,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 17:58:47,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:58:47,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:58:47,256 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:58:47,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:58:47,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1034005356, now seen corresponding path program 1 times [2018-12-09 17:58:47,256 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:58:47,256 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:58:47,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:58:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:58:47,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:58:47,518 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 12 treesize of output 15 [2018-12-09 17:58:47,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:47,530 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:58:47,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:47,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:47,546 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 17 treesize of output 24 [2018-12-09 17:58:47,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:58:47,588 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 15 treesize of output 14 [2018-12-09 17:58:47,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:47,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:47,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:47,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 17:58:47,713 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 17:58:47,713 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:47,718 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:47,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:58:47,754 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:57, output treesize:179 [2018-12-09 17:58:47,888 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-09 17:58:47,904 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 65 treesize of output 60 [2018-12-09 17:58:47,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:47,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:47,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:47,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 60 treesize of output 52 [2018-12-09 17:58:47,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 55 [2018-12-09 17:58:48,038 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,091 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 55 treesize of output 48 [2018-12-09 17:58:48,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,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 48 treesize of output 44 [2018-12-09 17:58:48,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:48,150 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 13 treesize of output 6 [2018-12-09 17:58:48,150 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,162 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,204 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 52 treesize of output 48 [2018-12-09 17:58:48,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:48,207 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 13 treesize of output 6 [2018-12-09 17:58:48,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,222 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,257 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 32 treesize of output 28 [2018-12-09 17:58:48,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:48,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 17:58:48,259 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,267 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:48,286 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:131, output treesize:16 [2018-12-09 17:58:49,266 WARN L180 SmtUtils]: Spent 953.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 17:58:50,139 WARN L180 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 17:58:51,168 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 17:58:51,171 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 17:58:51,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,181 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 17:58:51,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:10 [2018-12-09 17:58:51,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:58:51,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:58:51,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:58:51,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:58:51,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-09 17:58:51,492 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 21 treesize of output 16 [2018-12-09 17:58:51,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:51,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 17:58:51,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,562 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 21 treesize of output 16 [2018-12-09 17:58:51,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:51,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 17:58:51,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-12-09 17:58:51,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-12-09 17:58:51,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:51,782 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 2 case distinctions, treesize of input 24 treesize of output 49 [2018-12-09 17:58:51,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 17:58:51,876 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 25 treesize of output 30 [2018-12-09 17:58:51,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:51,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:58:52,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 83 [2018-12-09 17:58:52,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:52,124 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 4 case distinctions, treesize of input 63 treesize of output 90 [2018-12-09 17:58:52,125 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-09 17:58:52,359 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 60 treesize of output 65 [2018-12-09 17:58:52,359 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:52,453 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:52,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-12-09 17:58:52,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:52,474 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 45 treesize of output 72 [2018-12-09 17:58:52,474 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:52,495 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:52,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:58:52,610 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:58, output treesize:195 [2018-12-09 17:58:53,103 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-12-09 17:58:53,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:53,269 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 2 case distinctions, treesize of input 128 treesize of output 139 [2018-12-09 17:58:53,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 17:58:53,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:53,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:53,608 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 131 treesize of output 123 [2018-12-09 17:58:53,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:53,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:53,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:53,614 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 129 treesize of output 121 [2018-12-09 17:58:53,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:53,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:53,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:53,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:53,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, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 119 [2018-12-09 17:58:53,940 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 122 [2018-12-09 17:58:54,228 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,433 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 123 treesize of output 117 [2018-12-09 17:58:54,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:54,438 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 22 treesize of output 25 [2018-12-09 17:58:54,438 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,479 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 115 [2018-12-09 17:58:54,486 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:54,487 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 22 treesize of output 25 [2018-12-09 17:58:54,487 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,527 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 116 [2018-12-09 17:58:54,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:54,725 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 22 treesize of output 14 [2018-12-09 17:58:54,726 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,763 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,964 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 105 treesize of output 99 [2018-12-09 17:58:54,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:54,969 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 22 treesize of output 14 [2018-12-09 17:58:54,970 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,996 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:54,999 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 107 treesize of output 101 [2018-12-09 17:58:55,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:55,003 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 22 treesize of output 14 [2018-12-09 17:58:55,003 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:55,032 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:55,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-12-09 17:58:55,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:55,235 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 22 treesize of output 25 [2018-12-09 17:58:55,236 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:55,277 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:55,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:58:55,454 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 12 variables, input treesize:257, output treesize:241 [2018-12-09 17:58:55,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:55,936 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:58:55,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 86 [2018-12-09 17:58:55,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-09 17:58:55,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:55,959 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 31 treesize of output 15 [2018-12-09 17:58:55,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:55,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:55,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:58:55,984 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:58:55,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-09 17:58:55,990 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 19 treesize of output 10 [2018-12-09 17:58:55,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:56,000 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 10 [2018-12-09 17:58:56,000 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:58:56,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:56,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:58:56,009 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:125, output treesize:9 [2018-12-09 17:58:56,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 17:58:56,178 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:58:56,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:58:56,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-09 17:58:56,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 17:58:56,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 17:58:56,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-12-09 17:58:56,182 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand 26 states. [2018-12-09 17:58:56,422 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-09 17:58:56,740 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2018-12-09 17:59:02,399 WARN L180 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-09 17:59:06,320 WARN L180 SmtUtils]: Spent 3.72 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-09 17:59:10,055 WARN L180 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2018-12-09 17:59:10,510 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-09 17:59:10,879 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2018-12-09 17:59:11,302 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-12-09 17:59:12,630 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-12-09 17:59:13,048 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-12-09 17:59:13,303 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-09 17:59:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:59:16,805 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-09 17:59:16,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-09 17:59:16,805 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-12-09 17:59:16,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:59:16,806 INFO L225 Difference]: With dead ends: 99 [2018-12-09 17:59:16,806 INFO L226 Difference]: Without dead ends: 99 [2018-12-09 17:59:16,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=274, Invalid=2269, Unknown=7, NotChecked=0, Total=2550 [2018-12-09 17:59:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-09 17:59:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-12-09 17:59:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:59:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-12-09 17:59:16,807 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 44 [2018-12-09 17:59:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:59:16,808 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-12-09 17:59:16,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 17:59:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-12-09 17:59:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:59:16,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:59:16,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:59:16,808 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:59:16,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:59:16,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1989394924, now seen corresponding path program 1 times [2018-12-09 17:59:16,809 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:59:16,809 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:59:16,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:59:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:59:17,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:59:17,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 17:59:17,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:17,070 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:59:17,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:17,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:17,082 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 17 treesize of output 24 [2018-12-09 17:59:17,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:59:17,111 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 15 treesize of output 14 [2018-12-09 17:59:17,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,129 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:59:17,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:59:17,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:59:17,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:128 [2018-12-09 17:59:17,223 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 9 treesize of output 7 [2018-12-09 17:59:17,225 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 17:59:17,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-12-09 17:59:17,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-09 17:59:17,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,270 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 17 treesize of output 13 [2018-12-09 17:59:17,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:17,273 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 13 treesize of output 6 [2018-12-09 17:59:17,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,278 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-12-09 17:59:17,497 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 17:59:17,500 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 17:59:17,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,526 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 17:59:17,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-09 17:59:17,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-09 17:59:17,640 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 19 treesize of output 20 [2018-12-09 17:59:17,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,684 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 18 treesize of output 17 [2018-12-09 17:59:17,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 17:59:17,731 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 17:59:17,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,753 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 17:59:17,753 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:38 [2018-12-09 17:59:17,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:17,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:17,963 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 17:59:17,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,986 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 17 treesize of output 13 [2018-12-09 17:59:17,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:17,989 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 13 treesize of output 6 [2018-12-09 17:59:17,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:17,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:18,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 17:59:18,003 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:70, output treesize:46 [2018-12-09 17:59:18,102 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 25 treesize of output 13 [2018-12-09 17:59:18,104 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 5 [2018-12-09 17:59:18,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:18,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:18,117 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 17:59:18,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:47 [2018-12-09 17:59:18,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2018-12-09 17:59:18,323 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 17:59:18,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:18,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-09 17:59:18,330 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:18,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:18,337 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 17:59:18,338 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:46, output treesize:7 [2018-12-09 17:59:18,461 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 17:59:18,461 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:59:18,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:59:18,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-09 17:59:18,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 17:59:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 17:59:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-12-09 17:59:18,465 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 26 states. [2018-12-09 17:59:20,391 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-12-09 17:59:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:59:22,780 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-09 17:59:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 17:59:22,781 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-12-09 17:59:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:59:22,781 INFO L225 Difference]: With dead ends: 98 [2018-12-09 17:59:22,782 INFO L226 Difference]: Without dead ends: 98 [2018-12-09 17:59:22,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=292, Invalid=2256, Unknown=2, NotChecked=0, Total=2550 [2018-12-09 17:59:22,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-09 17:59:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-09 17:59:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:59:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-09 17:59:22,784 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 45 [2018-12-09 17:59:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:59:22,784 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-09 17:59:22,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 17:59:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-09 17:59:22,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 17:59:22,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:59:22,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 17:59:22,785 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:59:22,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:59:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1989394925, now seen corresponding path program 1 times [2018-12-09 17:59:22,785 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:59:22,785 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 17:59:22,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:59:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:59:23,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:59:23,067 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 12 treesize of output 15 [2018-12-09 17:59:23,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:23,081 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:59:23,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:23,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:23,098 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 17 treesize of output 24 [2018-12-09 17:59:23,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 17:59:23,141 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 15 treesize of output 14 [2018-12-09 17:59:23,141 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:59:23,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:59:23,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 17:59:23,259 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 17:59:23,260 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,265 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:59:23,301 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:50, output treesize:158 [2018-12-09 17:59:23,421 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2018-12-09 17:59:23,424 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 44 [2018-12-09 17:59:23,426 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 17:59:23,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,476 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 44 [2018-12-09 17:59:23,478 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 17:59:23,478 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:59:23,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:75 [2018-12-09 17:59:23,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:23,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:23,585 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 46 treesize of output 38 [2018-12-09 17:59:23,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,634 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 46 treesize of output 39 [2018-12-09 17:59:23,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-12-09 17:59:23,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-12-09 17:59:23,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,757 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 29 treesize of output 25 [2018-12-09 17:59:23,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:23,759 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 13 treesize of output 6 [2018-12-09 17:59:23,759 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,769 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:23,786 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:93, output treesize:13 [2018-12-09 17:59:24,668 WARN L180 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 17:59:25,660 WARN L180 SmtUtils]: Spent 972.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 17:59:26,569 WARN L180 SmtUtils]: Spent 887.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 17:59:26,572 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 17:59:26,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,580 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 17:59:26,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:18, output treesize:7 [2018-12-09 17:59:26,750 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 17:59:26,753 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 17:59:26,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,793 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 17:59:26,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 10 treesize of output 9 [2018-12-09 17:59:26,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-12-09 17:59:26,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-12-09 17:59:26,934 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 22 treesize of output 27 [2018-12-09 17:59:26,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:26,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:27,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 62 [2018-12-09 17:59:27,042 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 47 treesize of output 52 [2018-12-09 17:59:27,042 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:27,164 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 42 treesize of output 51 [2018-12-09 17:59:27,164 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 17:59:27,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:59:27,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:59:27,288 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:44, output treesize:95 [2018-12-09 17:59:27,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:27,663 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 90 treesize of output 97 [2018-12-09 17:59:27,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:27,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:27,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:27,802 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 90 treesize of output 82 [2018-12-09 17:59:27,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:27,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:27,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:27,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:27,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 84 [2018-12-09 17:59:27,919 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:28,055 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 2 case distinctions, treesize of input 82 treesize of output 89 [2018-12-09 17:59:28,056 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 17:59:28,226 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 85 treesize of output 81 [2018-12-09 17:59:28,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:28,230 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 13 treesize of output 6 [2018-12-09 17:59:28,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:28,253 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:28,255 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 83 treesize of output 79 [2018-12-09 17:59:28,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:28,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 17:59:28,259 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:28,281 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:28,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2018-12-09 17:59:28,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:28,398 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 13 treesize of output 6 [2018-12-09 17:59:28,398 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:28,421 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:28,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:59:28,529 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:181, output treesize:187 [2018-12-09 17:59:30,307 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:59:30,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 73 [2018-12-09 17:59:30,315 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:59:30,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-09 17:59:30,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:30,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-09 17:59:30,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:30,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:30,355 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 17:59:30,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2018-12-09 17:59:30,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-09 17:59:30,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:30,367 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 17:59:30,367 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:30,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:30,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:30,376 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:9 [2018-12-09 17:59:30,533 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 17:59:30,533 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:59:30,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:59:30,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-12-09 17:59:30,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 17:59:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 17:59:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=575, Unknown=3, NotChecked=0, Total=650 [2018-12-09 17:59:30,537 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 26 states. [2018-12-09 17:59:30,729 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-09 17:59:30,993 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 40 [2018-12-09 17:59:34,245 WARN L180 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-09 17:59:37,382 WARN L180 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-09 17:59:40,711 WARN L180 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-12-09 17:59:41,099 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2018-12-09 17:59:41,420 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-12-09 17:59:41,757 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2018-12-09 17:59:42,647 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-12-09 17:59:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 17:59:56,840 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-09 17:59:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 17:59:56,840 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-12-09 17:59:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 17:59:56,841 INFO L225 Difference]: With dead ends: 97 [2018-12-09 17:59:56,841 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 17:59:56,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=274, Invalid=2167, Unknown=9, NotChecked=0, Total=2450 [2018-12-09 17:59:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 17:59:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 17:59:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 17:59:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-09 17:59:56,843 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 45 [2018-12-09 17:59:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 17:59:56,843 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-09 17:59:56,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 17:59:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-09 17:59:56,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 17:59:56,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 17:59:56,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:56,844 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 17:59:56,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 17:59:56,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1073148402, now seen corresponding path program 1 times [2018-12-09 17:59:56,845 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 17:59:56,845 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 17:59:56,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 17:59:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 17:59:57,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 17:59:57,124 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 12 treesize of output 15 [2018-12-09 17:59:57,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:57,136 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 17:59:57,139 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 15 treesize of output 14 [2018-12-09 17:59:57,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:57,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:57,170 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 17 treesize of output 24 [2018-12-09 17:59:57,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 17:59:57,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:59:57,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 17:59:57,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 17:59:57,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:128 [2018-12-09 17:59:57,285 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 9 treesize of output 7 [2018-12-09 17:59:57,286 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 17:59:57,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:27 [2018-12-09 17:59:57,318 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 17:59:57,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,329 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 17 treesize of output 13 [2018-12-09 17:59:57,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:57,331 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 13 treesize of output 6 [2018-12-09 17:59:57,331 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,336 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:10 [2018-12-09 17:59:57,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 17:59:57,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 17:59:57,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,596 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 17:59:57,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-09 17:59:57,664 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 21 treesize of output 16 [2018-12-09 17:59:57,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:57,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 17:59:57,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,710 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 17:59:57,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-12-09 17:59:57,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-12-09 17:59:57,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:57,867 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 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-09 17:59:57,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 17:59:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-12-09 17:59:57,955 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:57,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:59:58,037 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 2 xjuncts. [2018-12-09 17:59:58,038 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:68 [2018-12-09 17:59:58,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:58,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:58,412 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 17 treesize of output 8 [2018-12-09 17:59:58,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:58,432 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 17:59:58,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:58,451 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 32 treesize of output 26 [2018-12-09 17:59:58,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:58,454 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 26 treesize of output 18 [2018-12-09 17:59:58,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:58,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:58,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:58,468 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:69, output treesize:34 [2018-12-09 17:59:58,791 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 31 treesize of output 22 [2018-12-09 17:59:58,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-09 17:59:58,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:58,798 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 11 treesize of output 1 [2018-12-09 17:59:58,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:58,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 17:59:58,802 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 17:59:58,803 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:41, output treesize:11 [2018-12-09 17:59:59,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2018-12-09 17:59:59,048 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 17:59:59,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 17:59:59,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-09 17:59:59,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:59,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 17:59:59,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 17:59:59,090 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:51 [2018-12-09 17:59:59,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 17:59:59,250 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 14 treesize of output 23 [2018-12-09 17:59:59,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 17:59:59,255 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 17:59:59,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:12 [2018-12-09 17:59:59,326 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 17:59:59,326 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 17:59:59,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 17:59:59,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-12-09 17:59:59,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 17:59:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 17:59:59,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2018-12-09 17:59:59,330 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 31 states. [2018-12-09 18:00:02,958 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2018-12-09 18:00:03,298 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-09 18:00:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:00:07,477 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2018-12-09 18:00:07,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-09 18:00:07,477 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-12-09 18:00:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:00:07,478 INFO L225 Difference]: With dead ends: 128 [2018-12-09 18:00:07,478 INFO L226 Difference]: Without dead ends: 128 [2018-12-09 18:00:07,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=440, Invalid=3458, Unknown=8, NotChecked=0, Total=3906 [2018-12-09 18:00:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-09 18:00:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2018-12-09 18:00:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 18:00:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-09 18:00:07,480 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 54 [2018-12-09 18:00:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:00:07,480 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-09 18:00:07,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 18:00:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-09 18:00:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 18:00:07,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:00:07,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:00:07,481 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 18:00:07,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:00:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1073148403, now seen corresponding path program 1 times [2018-12-09 18:00:07,481 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 18:00:07,481 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:00:07,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:00:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:00:07,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:00:07,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 18:00:07,865 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 18:00:07,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:07,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:07,908 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 12 treesize of output 15 [2018-12-09 18:00:07,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:07,926 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 18:00:07,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:07,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:07,943 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 17 treesize of output 24 [2018-12-09 18:00:07,943 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 18:00:07,971 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 15 treesize of output 14 [2018-12-09 18:00:07,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:07,990 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:00:08,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:00:08,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 18:00:08,038 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:57, output treesize:179 [2018-12-09 18:00:08,166 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2018-12-09 18:00:08,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:08,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:08,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2018-12-09 18:00:08,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,250 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 65 treesize of output 58 [2018-12-09 18:00:08,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-12-09 18:00:08,310 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-12-09 18:00:08,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,423 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 52 treesize of output 48 [2018-12-09 18:00:08,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:08,427 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 13 treesize of output 6 [2018-12-09 18:00:08,427 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,485 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 36 treesize of output 32 [2018-12-09 18:00:08,487 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:08,487 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 13 treesize of output 6 [2018-12-09 18:00:08,487 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,496 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,534 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 48 treesize of output 44 [2018-12-09 18:00:08,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:08,538 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 13 treesize of output 6 [2018-12-09 18:00:08,538 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,552 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,580 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 32 treesize of output 28 [2018-12-09 18:00:08,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:08,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 18:00:08,582 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,590 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:08,602 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:131, output treesize:16 [2018-12-09 18:00:09,616 WARN L180 SmtUtils]: Spent 984.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 18:00:10,508 WARN L180 SmtUtils]: Spent 875.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 18:00:11,517 WARN L180 SmtUtils]: Spent 989.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 18:00:11,520 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 18:00:11,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,530 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 18:00:11,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:10 [2018-12-09 18:00:11,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:00:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 18:00:11,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:00:11,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 18:00:11,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-09 18:00:11,856 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 21 treesize of output 16 [2018-12-09 18:00:11,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:11,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 18:00:11,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,932 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 21 treesize of output 16 [2018-12-09 18:00:11,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:11,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 18:00:11,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:11,990 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-12-09 18:00:12,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-12-09 18:00:12,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:12,163 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 2 case distinctions, treesize of input 24 treesize of output 49 [2018-12-09 18:00:12,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:00:12,279 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 25 treesize of output 30 [2018-12-09 18:00:12,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:12,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:00:12,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 62 treesize of output 57 [2018-12-09 18:00:12,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:12,416 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 45 treesize of output 72 [2018-12-09 18:00:12,416 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:12,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:12,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 83 [2018-12-09 18:00:12,487 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 70 treesize of output 75 [2018-12-09 18:00:12,487 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:12,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:12,666 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 4 case distinctions, treesize of input 63 treesize of output 90 [2018-12-09 18:00:12,666 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-09 18:00:12,915 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:00:13,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:00:13,057 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:58, output treesize:195 [2018-12-09 18:00:13,256 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 18:00:13,571 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2018-12-09 18:00:13,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:13,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:13,737 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 128 treesize of output 120 [2018-12-09 18:00:13,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:13,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:13,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:13,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:13,925 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 119 [2018-12-09 18:00:13,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:14,109 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 2 case distinctions, treesize of input 120 treesize of output 127 [2018-12-09 18:00:14,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 18:00:14,381 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 119 treesize of output 122 [2018-12-09 18:00:14,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:14,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 116 [2018-12-09 18:00:14,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:14,609 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 22 treesize of output 14 [2018-12-09 18:00:14,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:14,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:14,858 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 121 treesize of output 115 [2018-12-09 18:00:14,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:14,862 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 22 treesize of output 14 [2018-12-09 18:00:14,862 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:14,896 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:14,899 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 123 treesize of output 117 [2018-12-09 18:00:14,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:14,904 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 22 treesize of output 14 [2018-12-09 18:00:14,904 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:14,941 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:15,120 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 101 treesize of output 95 [2018-12-09 18:00:15,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:15,123 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 22 treesize of output 14 [2018-12-09 18:00:15,124 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:15,152 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:15,155 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 103 treesize of output 97 [2018-12-09 18:00:15,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:15,159 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 22 treesize of output 14 [2018-12-09 18:00:15,159 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:15,189 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:15,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-12-09 18:00:15,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:15,348 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 22 treesize of output 25 [2018-12-09 18:00:15,348 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:15,378 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:15,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 18:00:15,509 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 12 variables, input treesize:257, output treesize:233 [2018-12-09 18:00:16,033 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 61 treesize of output 50 [2018-12-09 18:00:16,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-09 18:00:16,036 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 18:00:16,045 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 9 treesize of output 1 [2018-12-09 18:00:16,045 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,051 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 18:00:16,066 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 26 [2018-12-09 18:00:16,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,075 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 18:00:16,075 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:85, output treesize:12 [2018-12-09 18:00:16,361 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 18:00:16,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 83 [2018-12-09 18:00:16,393 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 52 [2018-12-09 18:00:16,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-09 18:00:16,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2018-12-09 18:00:16,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,469 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 49 treesize of output 43 [2018-12-09 18:00:16,469 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 18:00:16,569 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 64 treesize of output 52 [2018-12-09 18:00:16,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:16,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:16,578 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2018-12-09 18:00:16,578 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,589 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 18:00:16,589 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,596 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,601 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 54 treesize of output 42 [2018-12-09 18:00:16,618 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 31 treesize of output 32 [2018-12-09 18:00:16,619 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 18:00:16,637 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 13 [2018-12-09 18:00:16,637 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,639 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 5 [2018-12-09 18:00:16,639 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:16,652 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:00:16,685 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 3 xjuncts. [2018-12-09 18:00:16,686 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:120, output treesize:67 [2018-12-09 18:00:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:00:16,880 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 18:00:16,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:00:16,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-12-09 18:00:16,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 18:00:16,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 18:00:16,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2018-12-09 18:00:16,884 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 29 states. [2018-12-09 18:00:17,099 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2018-12-09 18:00:17,410 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-12-09 18:00:21,183 WARN L180 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-09 18:00:25,340 WARN L180 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-09 18:00:29,158 WARN L180 SmtUtils]: Spent 3.68 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-09 18:00:29,595 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-12-09 18:00:29,980 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-12-09 18:00:30,415 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-12-09 18:00:31,720 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2018-12-09 18:00:32,068 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-12-09 18:00:32,338 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-12-09 18:00:33,616 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-12-09 18:00:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:00:36,409 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-09 18:00:36,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 18:00:36,410 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-12-09 18:00:36,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:00:36,411 INFO L225 Difference]: With dead ends: 100 [2018-12-09 18:00:36,411 INFO L226 Difference]: Without dead ends: 100 [2018-12-09 18:00:36,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=465, Invalid=3313, Unknown=4, NotChecked=0, Total=3782 [2018-12-09 18:00:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-09 18:00:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-12-09 18:00:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 18:00:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-09 18:00:36,413 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 54 [2018-12-09 18:00:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:00:36,413 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-09 18:00:36,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 18:00:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-09 18:00:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 18:00:36,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:00:36,413 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:00:36,414 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 18:00:36,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:00:36,414 INFO L82 PathProgramCache]: Analyzing trace with hash 710557809, now seen corresponding path program 1 times [2018-12-09 18:00:36,414 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 18:00:36,414 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:00:36,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:00:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:00:36,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:00:36,595 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 9 treesize of output 7 [2018-12-09 18:00:36,597 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 18:00:36,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:36,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:36,598 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 18:00:36,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2018-12-09 18:00:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:00:36,627 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 18:00:36,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:00:36,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:00:36,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:00:36,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:00:36,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:00:36,630 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 7 states. [2018-12-09 18:00:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:00:37,011 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-09 18:00:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 18:00:37,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-12-09 18:00:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:00:37,012 INFO L225 Difference]: With dead ends: 97 [2018-12-09 18:00:37,012 INFO L226 Difference]: Without dead ends: 97 [2018-12-09 18:00:37,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:00:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-09 18:00:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-09 18:00:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 18:00:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-09 18:00:37,014 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 59 [2018-12-09 18:00:37,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:00:37,014 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-09 18:00:37,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:00:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-09 18:00:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 18:00:37,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:00:37,014 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:00:37,015 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 18:00:37,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:00:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 710557810, now seen corresponding path program 1 times [2018-12-09 18:00:37,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 18:00:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:00:37,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:00:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:00:37,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:00:37,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:00:37,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 8 treesize of output 7 [2018-12-09 18:00:37,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:37,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:37,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:00:37,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 8 treesize of output 7 [2018-12-09 18:00:37,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:37,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:37,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:37,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:23, output treesize:1 [2018-12-09 18:00:37,677 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 89 [2018-12-09 18:00:37,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 70 [2018-12-09 18:00:37,682 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 18:00:37,773 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 70 treesize of output 59 [2018-12-09 18:00:37,773 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:37,864 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 65 [2018-12-09 18:00:37,865 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 18:00:37,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 18:00:38,117 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 61 treesize of output 51 [2018-12-09 18:00:38,121 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 45 treesize of output 20 [2018-12-09 18:00:38,121 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:38,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:38,145 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 59 treesize of output 49 [2018-12-09 18:00:38,149 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 45 treesize of output 20 [2018-12-09 18:00:38,149 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:38,166 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:38,169 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 55 treesize of output 45 [2018-12-09 18:00:38,172 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 45 treesize of output 20 [2018-12-09 18:00:38,172 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:38,186 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:38,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:38,211 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:98, output treesize:20 [2018-12-09 18:00:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:00:38,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:00:39,589 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 82 treesize of output 86 [2018-12-09 18:00:39,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 18:00:39,768 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 82 treesize of output 84 [2018-12-09 18:00:39,769 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 18:00:39,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-09 18:00:39,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:267 [2018-12-09 18:00:40,533 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2018-12-09 18:00:40,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:00:40,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:00:40,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:00:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:00:40,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:00:40,944 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 61 treesize of output 51 [2018-12-09 18:00:40,948 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 51 treesize of output 26 [2018-12-09 18:00:40,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:40,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:40,988 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 23 treesize of output 19 [2018-12-09 18:00:40,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-09 18:00:40,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:40,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:41,008 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 18:00:41,009 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:70, output treesize:20 [2018-12-09 18:00:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:00:41,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:00:41,419 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 82 treesize of output 86 [2018-12-09 18:00:41,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 18:00:41,613 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 82 treesize of output 84 [2018-12-09 18:00:41,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 18:00:41,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-12-09 18:00:41,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:267 [2018-12-09 18:00:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:00:42,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 18 [2018-12-09 18:00:42,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 18:00:42,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 18:00:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-12-09 18:00:42,311 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 19 states. [2018-12-09 18:00:45,071 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-09 18:00:48,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:00:48,154 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-12-09 18:00:48,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 18:00:48,155 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-12-09 18:00:48,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:00:48,156 INFO L225 Difference]: With dead ends: 113 [2018-12-09 18:00:48,156 INFO L226 Difference]: Without dead ends: 113 [2018-12-09 18:00:48,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=155, Invalid=1327, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 18:00:48,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-09 18:00:48,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-12-09 18:00:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 18:00:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-09 18:00:48,158 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 59 [2018-12-09 18:00:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:00:48,158 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-09 18:00:48,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 18:00:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-09 18:00:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 18:00:48,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:00:48,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:00:48,159 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 18:00:48,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:00:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash -124859678, now seen corresponding path program 1 times [2018-12-09 18:00:48,159 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 18:00:48,159 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:00:48,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:00:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:00:48,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:00:48,333 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 9 treesize of output 7 [2018-12-09 18:00:48,335 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 18:00:48,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:48,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:48,336 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 18:00:48,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2018-12-09 18:00:48,347 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 9 treesize of output 7 [2018-12-09 18:00:48,349 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 18:00:48,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:48,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:48,350 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 18:00:48,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2018-12-09 18:00:48,393 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 18:00:48,393 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 18:00:48,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:00:48,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:00:48,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:00:48,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:00:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:00:48,397 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 9 states. [2018-12-09 18:00:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:00:57,001 INFO L93 Difference]: Finished difference Result 106 states and 108 transitions. [2018-12-09 18:00:57,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 18:00:57,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-12-09 18:00:57,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:00:57,002 INFO L225 Difference]: With dead ends: 106 [2018-12-09 18:00:57,002 INFO L226 Difference]: Without dead ends: 106 [2018-12-09 18:00:57,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:00:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-09 18:00:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-09 18:00:57,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 18:00:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-09 18:00:57,003 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 61 [2018-12-09 18:00:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:00:57,004 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-09 18:00:57,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:00:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-09 18:00:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 18:00:57,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:00:57,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:00:57,004 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 18:00:57,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:00:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash -124859677, now seen corresponding path program 1 times [2018-12-09 18:00:57,005 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 18:00:57,005 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 18:00:57,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:00:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:00:57,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:00:57,218 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 17 treesize of output 13 [2018-12-09 18:00:57,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:57,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-09 18:00:57,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,236 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 17 treesize of output 13 [2018-12-09 18:00:57,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:57,239 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 13 treesize of output 6 [2018-12-09 18:00:57,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:10 [2018-12-09 18:00:57,526 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 56 treesize of output 44 [2018-12-09 18:00:57,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:57,531 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 44 treesize of output 30 [2018-12-09 18:00:57,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,553 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 18:00:57,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:00:57,556 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 22 treesize of output 14 [2018-12-09 18:00:57,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:00:57,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:82, output treesize:11 [2018-12-09 18:00:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 18:00:57,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 18:00:57,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:00:57,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 18:00:57,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 18:00:57,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 18:00:57,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:00:57,677 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 14 states. [2018-12-09 18:00:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:00:59,816 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-12-09 18:00:59,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 18:00:59,817 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2018-12-09 18:00:59,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:00:59,817 INFO L225 Difference]: With dead ends: 104 [2018-12-09 18:00:59,817 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 18:00:59,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-12-09 18:00:59,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 18:00:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-09 18:00:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 18:00:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-09 18:00:59,819 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 61 [2018-12-09 18:00:59,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:00:59,819 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-09 18:00:59,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 18:00:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-09 18:00:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 18:00:59,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:00:59,820 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, 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 18:00:59,820 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 18:00:59,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:00:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash -109549283, now seen corresponding path program 1 times [2018-12-09 18:00:59,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 18:00:59,820 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:00:59,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:01:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:01:00,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:01:00,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 18:01:00,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:00,225 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 18:01:00,230 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 15 treesize of output 14 [2018-12-09 18:01:00,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:00,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:00,275 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 17 treesize of output 24 [2018-12-09 18:01:00,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:00,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:00,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:00,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 18:01:00,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 18:01:00,418 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,426 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 18:01:00,468 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:50, output treesize:158 [2018-12-09 18:01:00,627 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2018-12-09 18:01:00,632 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 44 [2018-12-09 18:01:00,637 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 18:01:00,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,754 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 44 [2018-12-09 18:01:00,758 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 18:01:00,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:00,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:75 [2018-12-09 18:01:00,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:00,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:00,905 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 46 treesize of output 38 [2018-12-09 18:01:00,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,953 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 46 treesize of output 39 [2018-12-09 18:01:00,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:00,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-12-09 18:01:00,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:01,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-12-09 18:01:01,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:01,073 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 29 treesize of output 25 [2018-12-09 18:01:01,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:01,076 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 13 treesize of output 6 [2018-12-09 18:01:01,076 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:01,081 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:01,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:01,098 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:93, output treesize:13 [2018-12-09 18:01:02,027 WARN L180 SmtUtils]: Spent 896.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-09 18:01:02,928 WARN L180 SmtUtils]: Spent 882.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 18:01:03,952 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 18:01:03,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 18:01:03,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:03,966 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 18:01:03,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:03,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:03,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:18, output treesize:7 [2018-12-09 18:01:04,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:01:04,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 18:01:04,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:04,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:04,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:04,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 18:01:04,212 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 21 treesize of output 16 [2018-12-09 18:01:04,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:04,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 18:01:04,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:04,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:04,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:04,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-09 18:01:04,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-12-09 18:01:04,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:04,391 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 2 case distinctions, treesize of input 24 treesize of output 37 [2018-12-09 18:01:04,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:04,482 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 25 treesize of output 24 [2018-12-09 18:01:04,483 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:04,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:04,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:04,551 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:54 [2018-12-09 18:01:08,078 WARN L180 SmtUtils]: Spent 3.21 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-12-09 18:01:08,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,088 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 82 treesize of output 74 [2018-12-09 18:01:08,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,192 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 82 treesize of output 89 [2018-12-09 18:01:08,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,303 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 2 case distinctions, treesize of input 74 treesize of output 81 [2018-12-09 18:01:08,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:08,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,425 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 72 [2018-12-09 18:01:08,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,533 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 73 treesize of output 67 [2018-12-09 18:01:08,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,538 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 26 treesize of output 18 [2018-12-09 18:01:08,538 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,559 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 18:01:08,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,564 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 26 treesize of output 18 [2018-12-09 18:01:08,564 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,657 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 72 treesize of output 66 [2018-12-09 18:01:08,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:08,661 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 26 treesize of output 18 [2018-12-09 18:01:08,662 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,679 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:08,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:08,749 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:165, output treesize:134 [2018-12-09 18:01:09,217 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 31 treesize of output 22 [2018-12-09 18:01:09,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-09 18:01:09,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:09,225 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 11 treesize of output 1 [2018-12-09 18:01:09,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:09,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:09,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:09,234 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:42, output treesize:12 [2018-12-09 18:01:09,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 33 [2018-12-09 18:01:09,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-09 18:01:09,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:09,541 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 18:01:09,542 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:09,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:09,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:09,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:55, output treesize:42 [2018-12-09 18:01:09,775 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 18:01:09,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:09,784 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 18:01:09,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-12-09 18:01:09,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:09,966 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 18:01:09,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:09,990 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 18:01:09,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:31 [2018-12-09 18:01:10,497 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 18:01:10,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:10,498 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 18:01:10,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:1 [2018-12-09 18:01:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:01:10,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:01:11,967 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-12-09 18:01:12,177 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-12-09 18:01:12,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 18:01:12,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:12,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-12-09 18:01:12,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:12,333 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 18:01:12,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:117, output treesize:75 [2018-12-09 18:01:12,654 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-09 18:01:13,030 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 18:01:13,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:01:13,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:01:13,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:01:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:01:13,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:01:13,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 18:01:13,172 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 18:01:13,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:13,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:13,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 18:01:13,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:13,204 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 21 [2018-12-09 18:01:13,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:13,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:13,215 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 17 treesize of output 24 [2018-12-09 18:01:13,215 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:13,238 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 15 treesize of output 14 [2018-12-09 18:01:13,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:13,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:13,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:13,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 18:01:13,296 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:39, output treesize:125 [2018-12-09 18:01:13,850 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 47 treesize of output 40 [2018-12-09 18:01:13,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:13,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 0 case distinctions, treesize of input 40 treesize of output 30 [2018-12-09 18:01:13,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:13,941 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 47 treesize of output 42 [2018-12-09 18:01:13,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:13,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:13,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:13,981 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 42 treesize of output 34 [2018-12-09 18:01:13,981 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,018 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 34 treesize of output 32 [2018-12-09 18:01:14,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 18:01:14,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,030 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,061 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 27 treesize of output 25 [2018-12-09 18:01:14,063 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 18:01:14,063 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,072 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,100 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 30 treesize of output 28 [2018-12-09 18:01:14,102 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 18:01:14,102 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,113 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,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 23 treesize of output 21 [2018-12-09 18:01:14,139 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 18:01:14,139 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,147 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:14,161 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:95, output treesize:16 [2018-12-09 18:01:15,371 WARN L180 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 18:01:16,538 WARN L180 SmtUtils]: Spent 1000.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-12-09 18:01:16,541 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 18:01:16,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:16,553 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 18:01:16,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:16,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:16,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:10 [2018-12-09 18:01:17,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:01:17,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 8 treesize of output 7 [2018-12-09 18:01:17,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:01:17,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 18:01:17,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,274 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-12-09 18:01:17,468 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 21 treesize of output 16 [2018-12-09 18:01:17,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:17,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 18:01:17,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,555 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 21 treesize of output 16 [2018-12-09 18:01:17,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:17,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 18:01:17,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,620 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-12-09 18:01:17,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2018-12-09 18:01:17,905 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 41 treesize of output 46 [2018-12-09 18:01:17,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:17,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:18,048 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 4 case distinctions, treesize of input 36 treesize of output 67 [2018-12-09 18:01:18,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-09 18:01:18,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:18,272 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 18:01:18,308 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 18:01:18,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 63 [2018-12-09 18:01:18,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:18,328 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-12-09 18:01:18,328 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:18,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:18,359 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 18:01:18,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 58 [2018-12-09 18:01:18,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:18,378 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 52 treesize of output 63 [2018-12-09 18:01:18,378 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:18,400 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:18,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 71 [2018-12-09 18:01:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 69 [2018-12-09 18:01:18,460 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:18,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:18,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:18,655 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 57 treesize of output 90 [2018-12-09 18:01:18,655 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:18,764 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:19,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:19,709 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:66, output treesize:187 [2018-12-09 18:01:20,190 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 18:01:20,815 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2018-12-09 18:01:21,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:21,153 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 110 treesize of output 117 [2018-12-09 18:01:21,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:21,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:21,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:21,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:21,327 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 104 [2018-12-09 18:01:21,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:21,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:21,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:21,469 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 110 treesize of output 102 [2018-12-09 18:01:21,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:21,618 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 2 case distinctions, treesize of input 102 treesize of output 109 [2018-12-09 18:01:21,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:21,809 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 103 treesize of output 99 [2018-12-09 18:01:21,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-12-09 18:01:21,812 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:21,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:21,850 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 105 treesize of output 101 [2018-12-09 18:01:21,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-12-09 18:01:21,854 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:21,888 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 100 [2018-12-09 18:01:22,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-12-09 18:01:22,073 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,106 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2018-12-09 18:01:22,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 18:01:22,289 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,315 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,476 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 96 treesize of output 92 [2018-12-09 18:01:22,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 18:01:22,479 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,505 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,507 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 98 treesize of output 94 [2018-12-09 18:01:22,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-09 18:01:22,510 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,537 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:22,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 18:01:22,672 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 12 variables, input treesize:221, output treesize:241 [2018-12-09 18:01:23,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:23,711 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 18:01:23,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 60 treesize of output 57 [2018-12-09 18:01:23,720 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 9 treesize of output 1 [2018-12-09 18:01:23,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:23,755 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 20 treesize of output 21 [2018-12-09 18:01:23,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:23,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:23,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-12-09 18:01:23,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-09 18:01:23,823 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:23,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:23,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:23,849 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-09 18:01:23,850 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:23,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:23,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-12-09 18:01:23,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-09 18:01:23,871 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:23,915 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 27 treesize of output 28 [2018-12-09 18:01:23,915 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:23,929 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:23,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:01:23,953 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:105, output treesize:41 [2018-12-09 18:01:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:01:25,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 18:01:25,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:01:25,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [36] total 59 [2018-12-09 18:01:25,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-09 18:01:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-09 18:01:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=4256, Unknown=0, NotChecked=0, Total=4556 [2018-12-09 18:01:25,391 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 59 states. [2018-12-09 18:01:25,666 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-09 18:01:26,245 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-12-09 18:01:30,426 WARN L180 SmtUtils]: Spent 3.74 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-09 18:01:34,086 WARN L180 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-09 18:01:37,675 WARN L180 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-09 18:01:38,237 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2018-12-09 18:01:38,679 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-12-09 18:01:39,191 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-09 18:01:41,249 WARN L180 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2018-12-09 18:01:41,915 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-09 18:01:42,414 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-09 18:01:44,070 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2018-12-09 18:01:44,457 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2018-12-09 18:01:48,338 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2018-12-09 18:01:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:01:49,768 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2018-12-09 18:01:49,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-09 18:01:49,768 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 63 [2018-12-09 18:01:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:01:49,769 INFO L225 Difference]: With dead ends: 68 [2018-12-09 18:01:49,769 INFO L226 Difference]: Without dead ends: 68 [2018-12-09 18:01:49,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=736, Invalid=9164, Unknown=0, NotChecked=0, Total=9900 [2018-12-09 18:01:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-09 18:01:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-09 18:01:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 18:01:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2018-12-09 18:01:49,772 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 63 [2018-12-09 18:01:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:01:49,772 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2018-12-09 18:01:49,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-09 18:01:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2018-12-09 18:01:49,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 18:01:49,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:01:49,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1] [2018-12-09 18:01:49,773 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION]=== [2018-12-09 18:01:49,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:01:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash 938308599, now seen corresponding path program 1 times [2018-12-09 18:01:49,774 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 18:01:49,774 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:01:49,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:01:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:01:50,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:01:50,109 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-12-09 18:01:50,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:50,123 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 2 case distinctions, treesize of input 20 treesize of output 21 [2018-12-09 18:01:50,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:50,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:50,136 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 17 treesize of output 24 [2018-12-09 18:01:50,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 18:01:50,159 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 15 treesize of output 14 [2018-12-09 18:01:50,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:50,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:01:50,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2018-12-09 18:01:50,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:50,197 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-12-09 18:01:50,201 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 18:01:50,201 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,206 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 18:01:50,237 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:42, output treesize:107 [2018-12-09 18:01:50,271 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 9 treesize of output 7 [2018-12-09 18:01:50,272 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 18:01:50,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-09 18:01:50,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 18:01:50,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:11 [2018-12-09 18:01:50,298 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 18:01:50,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-12-09 18:01:50,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:01:50,347 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 5 [2018-12-09 18:01:50,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,350 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 18:01:50,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-12-09 18:01:50,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:01:50,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 18:01:50,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,437 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 18:01:50,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-12-09 18:01:50,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-12-09 18:01:50,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:01:50,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:10 [2018-12-09 18:01:50,674 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 18:01:50,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 18:01:50,676 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 18:01:50,679 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 18:01:50,684 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 18:01:50,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2018-12-09 18:02:02,210 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 14 [2018-12-09 18:02:02,212 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 5 [2018-12-09 18:02:02,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:02,216 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 18:02:02,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-12-09 18:02:21,368 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 18:02:21,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:22,268 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_alloc_13_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |c_#valid| v_alloc_13_~p~0.base_12) (_ bv0 1))) (= (store |c_#valid| v_alloc_13_~p~0.base_12 (_ bv0 1)) |c_old(#valid)|))) is different from false [2018-12-09 18:02:22,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:22,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/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 18:02:22,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:22,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:02:22,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 18:02:22,450 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 5 [2018-12-09 18:02:22,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:22,452 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 18:02:22,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-09 18:02:22,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 18:02:22,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 18:02:22,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:22,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:22,612 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 18:02:22,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-12-09 18:02:22,777 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 9 treesize of output 1 [2018-12-09 18:02:22,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:22,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:22,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-12-09 18:02:22,933 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 18:02:22,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 18:02:22,935 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 18:02:22,938 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 18:02:22,941 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 18:02:22,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:12 [2018-12-09 18:02:23,837 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_224 (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| v_arrayElimCell_224 (_ bv0 1))) (= (select |c_old(#valid)| v_arrayElimCell_224) (_ bv0 1)))) is different from true [2018-12-09 18:02:23,840 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 5 [2018-12-09 18:02:23,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:23,842 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 18:02:23,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-12-09 18:02:40,300 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_131 (_ BitVec 32))) (= (select |c_#valid| v_prenex_131) (_ bv0 1))) (exists ((v_arrayElimCell_224 (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| v_arrayElimCell_224 (_ bv0 1))) (= (select |c_old(#valid)| v_arrayElimCell_224) (_ bv0 1))))) is different from true [2018-12-09 18:02:40,306 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 18:02:40,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:40,996 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_alloc_13_~p~0.base_19 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| v_alloc_13_~p~0.base_19))) (= (store |c_#valid| v_alloc_13_~p~0.base_19 (_ bv0 1)) |c_old(#valid)|))) is different from false [2018-12-09 18:02:41,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 18:02:41,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 39 [2018-12-09 18:02:41,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-09 18:02:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-09 18:02:41,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1230, Unknown=24, NotChecked=300, Total=1722 [2018-12-09 18:02:41,014 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand 40 states. [2018-12-09 18:03:56,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:03:56,442 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2018-12-09 18:03:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 18:03:56,442 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 67 [2018-12-09 18:03:56,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:03:56,442 INFO L225 Difference]: With dead ends: 67 [2018-12-09 18:03:56,442 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 18:03:56,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 79.4s TimeCoverageRelationStatistics Valid=428, Invalid=2973, Unknown=37, NotChecked=468, Total=3906 [2018-12-09 18:03:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 18:03:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 18:03:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 18:03:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 18:03:56,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-12-09 18:03:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:03:56,444 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 18:03:56,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-09 18:03:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 18:03:56,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 18:03:56,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:03:56 BoogieIcfgContainer [2018-12-09 18:03:56,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:03:56,447 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:03:56,447 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:03:56,447 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:03:56,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:54:12" (3/4) ... [2018-12-09 18:03:56,450 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_13 [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_13 [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2018-12-09 18:03:56,454 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2018-12-09 18:03:56,458 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-12-09 18:03:56,458 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 18:03:56,458 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 18:03:56,484 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_715cc721-41bf-4f14-b19d-0b4c3dcecb41/bin-2019/utaipan/witness.graphml [2018-12-09 18:03:56,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:03:56,485 INFO L168 Benchmark]: Toolchain (without parser) took 585009.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 872.4 MB in the end (delta: 67.0 MB). Peak memory consumption was 208.0 MB. Max. memory is 11.5 GB. [2018-12-09 18:03:56,486 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 18:03:56,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-09 18:03:56,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.04 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 18:03:56,486 INFO L168 Benchmark]: Boogie Preprocessor took 19.97 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 18:03:56,486 INFO L168 Benchmark]: RCFGBuilder took 342.18 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. [2018-12-09 18:03:56,486 INFO L168 Benchmark]: TraceAbstraction took 584203.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.0 MB in the end (delta: 189.1 MB). Peak memory consumption was 189.1 MB. Max. memory is 11.5 GB. [2018-12-09 18:03:56,487 INFO L168 Benchmark]: Witness Printer took 37.64 ms. Allocated memory is still 1.2 GB. Free memory was 879.0 MB in the beginning and 872.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-09 18:03:56,488 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 382.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -168.7 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.04 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 19.97 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 342.18 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: 39.9 MB). Peak memory consumption was 39.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 584203.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 879.0 MB in the end (delta: 189.1 MB). Peak memory consumption was 189.1 MB. Max. memory is 11.5 GB. * Witness Printer took 37.64 ms. Allocated memory is still 1.2 GB. Free memory was 879.0 MB in the beginning and 872.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1121]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1121]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1116]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1116]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1115]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1115]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1463]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1099]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1099]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1100]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1100]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1108]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1110]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1109]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1108]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1107]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1109]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1107]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1110]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 100 locations, 31 error locations. SAFE Result, 584.1s OverallTime, 31 OverallIterations, 2 TraceHistogramMax, 449.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1805 SDtfs, 3748 SDslu, 7219 SDs, 0 SdLazy, 18832 SolverSat, 1658 SolverUnsat, 193 SolverUnknown, 0 SolverNotchecked, 274.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1699 GetRequests, 806 SyntacticMatches, 58 SemanticMatches, 835 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 8161 ImplicationChecksByTransitivity, 272.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=9, 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.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 363 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.9s SatisfiabilityAnalysisTime, 129.2s InterpolantComputationTime, 1305 NumberOfCodeBlocks, 1305 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1271 ConstructedInterpolants, 261 QuantifiedInterpolants, 1263661 SizeOfPredicates, 664 NumberOfNonLiveVariables, 6666 ConjunctsInSsa, 1420 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 18/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...