./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.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_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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 760c75961baa7cc196b373809e9a87dd0bcf8eb7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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 760c75961baa7cc196b373809e9a87dd0bcf8eb7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 16:26:27,189 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:26:27,190 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:26:27,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:26:27,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:26:27,197 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:26:27,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:26:27,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:26:27,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:26:27,200 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:26:27,200 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:26:27,200 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:26:27,201 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:26:27,201 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:26:27,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:26:27,202 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:26:27,203 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:26:27,204 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:26:27,205 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:26:27,205 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:26:27,206 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:26:27,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:26:27,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:26:27,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:26:27,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:26:27,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:26:27,209 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:26:27,210 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:26:27,210 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:26:27,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:26:27,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:26:27,211 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:26:27,211 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:26:27,211 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:26:27,212 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:26:27,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:26:27,213 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-08 16:26:27,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:26:27,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:26:27,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 16:26:27,221 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 16:26:27,221 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 16:26:27,221 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 16:26:27,221 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 16:26:27,221 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 16:26:27,221 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 16:26:27,222 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 16:26:27,222 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 16:26:27,222 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 16:26:27,222 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 16:26:27,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 16:26:27,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 16:26:27,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:26:27,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:26:27,223 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 16:26:27,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:26:27,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:26:27,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:26:27,223 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 16:26:27,224 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 16:26:27,224 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 16:26:27,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 16:26:27,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:26:27,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:26:27,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:26:27,224 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 16:26:27,224 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 16:26:27,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:26:27,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:26:27,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 16:26:27,225 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 16:26:27,225 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 16:26:27,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 16:26:27,225 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_b04775cb-73dd-473f-aa11-c7900932968b/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 -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2018-12-08 16:26:27,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:26:27,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:26:27,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:26:27,257 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:26:27,257 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:26:27,258 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i [2018-12-08 16:26:27,305 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data/f31854c6e/5ee821aa94204475a4b5e2992d793497/FLAGebb362812 [2018-12-08 16:26:27,678 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:26:27,679 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i [2018-12-08 16:26:27,687 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data/f31854c6e/5ee821aa94204475a4b5e2992d793497/FLAGebb362812 [2018-12-08 16:26:27,696 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data/f31854c6e/5ee821aa94204475a4b5e2992d793497 [2018-12-08 16:26:27,698 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:26:27,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:26:27,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:26:27,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:26:27,702 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:26:27,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e4483e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27, skipping insertion in model container [2018-12-08 16:26:27,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:26:27,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:26:27,877 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:26:27,882 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:26:27,939 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:26:27,959 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:26:27,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27 WrapperNode [2018-12-08 16:26:27,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:26:27,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:26:27,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:26:27,960 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:26:27,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:26:27,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:26:27,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:26:27,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:26:27,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... [2018-12-08 16:26:27,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:26:27,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:26:27,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:26:27,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:26:27,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:26:28,027 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2018-12-08 16:26:28,027 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-08 16:26:28,028 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 16:26:28,028 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 16:26:28,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 16:26:28,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:26:28,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:26:28,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:26:28,267 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:26:28,267 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 16:26:28,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:26:28 BoogieIcfgContainer [2018-12-08 16:26:28,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:26:28,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 16:26:28,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 16:26:28,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 16:26:28,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:26:27" (1/3) ... [2018-12-08 16:26:28,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612b0c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:26:28, skipping insertion in model container [2018-12-08 16:26:28,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:26:27" (2/3) ... [2018-12-08 16:26:28,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612b0c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:26:28, skipping insertion in model container [2018-12-08 16:26:28,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:26:28" (3/3) ... [2018-12-08 16:26:28,272 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order_false-valid-memtrack.i [2018-12-08 16:26:28,279 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 16:26:28,285 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-12-08 16:26:28,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-12-08 16:26:28,309 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 16:26:28,309 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 16:26:28,309 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 16:26:28,309 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:26:28,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:26:28,310 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 16:26:28,310 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:26:28,310 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 16:26:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-12-08 16:26:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 16:26:28,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:28,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:28,330 INFO L423 AbstractCegarLoop]: === Iteration 1 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:28,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash 166638613, now seen corresponding path program 1 times [2018-12-08 16:26:28,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:28,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:28,427 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-08 16:26:28,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:28,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:26:28,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:28,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:26:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:26:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:26:28,440 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2018-12-08 16:26:28,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:28,511 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-12-08 16:26:28,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:26:28,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 16:26:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:28,518 INFO L225 Difference]: With dead ends: 115 [2018-12-08 16:26:28,518 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 16:26:28,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:26:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 16:26:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-08 16:26:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-08 16:26:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-12-08 16:26:28,544 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 10 [2018-12-08 16:26:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:28,544 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-12-08 16:26:28,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:26:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-12-08 16:26:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 16:26:28,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:28,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:28,545 INFO L423 AbstractCegarLoop]: === Iteration 2 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:28,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:28,546 INFO L82 PathProgramCache]: Analyzing trace with hash 166638614, now seen corresponding path program 1 times [2018-12-08 16:26:28,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:28,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:28,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:28,605 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-08 16:26:28,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:28,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:26:28,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:28,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:26:28,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:26:28,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:26:28,607 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 3 states. [2018-12-08 16:26:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:28,629 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-08 16:26:28,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:26:28,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 16:26:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:28,630 INFO L225 Difference]: With dead ends: 105 [2018-12-08 16:26:28,630 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 16:26:28,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:26:28,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 16:26:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-08 16:26:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 16:26:28,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-08 16:26:28,635 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 10 [2018-12-08 16:26:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:28,635 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-08 16:26:28,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:26:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-08 16:26:28,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 16:26:28,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:28,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:28,636 INFO L423 AbstractCegarLoop]: === Iteration 3 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:28,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:28,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1278525649, now seen corresponding path program 1 times [2018-12-08 16:26:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:28,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:28,677 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-08 16:26:28,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:28,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:26:28,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:28,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:26:28,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:26:28,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:26:28,678 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 5 states. [2018-12-08 16:26:28,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:28,758 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-12-08 16:26:28,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:26:28,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-08 16:26:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:28,759 INFO L225 Difference]: With dead ends: 115 [2018-12-08 16:26:28,759 INFO L226 Difference]: Without dead ends: 115 [2018-12-08 16:26:28,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:26:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-08 16:26:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-08 16:26:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-08 16:26:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-12-08 16:26:28,764 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 15 [2018-12-08 16:26:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:28,764 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-12-08 16:26:28,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:26:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-12-08 16:26:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 16:26:28,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:28,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:28,765 INFO L423 AbstractCegarLoop]: === Iteration 4 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:28,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:28,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1278525650, now seen corresponding path program 1 times [2018-12-08 16:26:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:28,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:28,788 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-08 16:26:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:26:28,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:26:28,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:26:28,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:26:28,789 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 5 states. [2018-12-08 16:26:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:28,802 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-12-08 16:26:28,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:26:28,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-08 16:26:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:28,803 INFO L225 Difference]: With dead ends: 113 [2018-12-08 16:26:28,803 INFO L226 Difference]: Without dead ends: 113 [2018-12-08 16:26:28,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:26:28,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-08 16:26:28,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-12-08 16:26:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-08 16:26:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-12-08 16:26:28,808 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 15 [2018-12-08 16:26:28,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:28,808 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-12-08 16:26:28,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:26:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-12-08 16:26:28,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 16:26:28,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:28,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:28,809 INFO L423 AbstractCegarLoop]: === Iteration 5 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:28,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1278527187, now seen corresponding path program 1 times [2018-12-08 16:26:28,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:28,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:28,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:28,835 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-08 16:26:28,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:28,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:26:28,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:28,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:26:28,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:26:28,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:26:28,836 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 3 states. [2018-12-08 16:26:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:28,853 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2018-12-08 16:26:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:26:28,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 16:26:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:28,855 INFO L225 Difference]: With dead ends: 108 [2018-12-08 16:26:28,855 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 16:26:28,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:26:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 16:26:28,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-08 16:26:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-08 16:26:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-12-08 16:26:28,859 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 15 [2018-12-08 16:26:28,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:28,859 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-12-08 16:26:28,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:26:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-12-08 16:26:28,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 16:26:28,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:28,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:28,861 INFO L423 AbstractCegarLoop]: === Iteration 6 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:28,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:28,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1278527186, now seen corresponding path program 1 times [2018-12-08 16:26:28,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:28,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:28,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:28,876 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-08 16:26:28,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:28,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:26:28,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:28,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:26:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:26:28,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:26:28,878 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 3 states. [2018-12-08 16:26:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:28,912 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-12-08 16:26:28,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:26:28,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 16:26:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:28,913 INFO L225 Difference]: With dead ends: 107 [2018-12-08 16:26:28,913 INFO L226 Difference]: Without dead ends: 107 [2018-12-08 16:26:28,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:26:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-08 16:26:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-08 16:26:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-08 16:26:28,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-08 16:26:28,917 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 15 [2018-12-08 16:26:28,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:28,917 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-08 16:26:28,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:26:28,918 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-08 16:26:28,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 16:26:28,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:28,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:28,919 INFO L423 AbstractCegarLoop]: === Iteration 7 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:28,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:28,919 INFO L82 PathProgramCache]: Analyzing trace with hash 979637218, now seen corresponding path program 1 times [2018-12-08 16:26:28,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:28,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:28,960 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-08 16:26:28,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:28,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:26:28,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:28,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:26:28,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:26:28,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:26:28,961 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 4 states. [2018-12-08 16:26:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:28,998 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-08 16:26:28,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:26:28,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-08 16:26:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:28,999 INFO L225 Difference]: With dead ends: 108 [2018-12-08 16:26:28,999 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 16:26:28,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:26:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 16:26:29,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-08 16:26:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-08 16:26:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-08 16:26:29,003 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 16 [2018-12-08 16:26:29,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:29,003 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-08 16:26:29,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:26:29,003 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-08 16:26:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 16:26:29,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:29,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] [2018-12-08 16:26:29,005 INFO L423 AbstractCegarLoop]: === Iteration 8 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:29,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:29,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2135134892, now seen corresponding path program 1 times [2018-12-08 16:26:29,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:29,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:29,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:29,032 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-08 16:26:29,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:29,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:26:29,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:29,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:26:29,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:26:29,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:26:29,033 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 4 states. [2018-12-08 16:26:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:29,101 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-08 16:26:29,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:26:29,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-08 16:26:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:29,102 INFO L225 Difference]: With dead ends: 105 [2018-12-08 16:26:29,102 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 16:26:29,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:26:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 16:26:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-08 16:26:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 16:26:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-08 16:26:29,107 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 20 [2018-12-08 16:26:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:29,107 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-08 16:26:29,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:26:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-08 16:26:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 16:26:29,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:29,108 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-08 16:26:29,108 INFO L423 AbstractCegarLoop]: === Iteration 9 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:29,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2135134891, now seen corresponding path program 1 times [2018-12-08 16:26:29,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:29,144 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-08 16:26:29,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:29,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:26:29,145 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-08 16:26:29,146 INFO L205 CegarAbsIntRunner]: [0], [1], [104], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [157], [160], [161], [162], [164] [2018-12-08 16:26:29,168 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:26:29,168 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:26:29,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:26:29,315 INFO L272 AbstractInterpreter]: Visited 20 different actions 40 times. Merged at 8 different actions 18 times. Never widened. Performed 453 root evaluator evaluations with a maximum evaluation depth of 3. Performed 453 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-08 16:26:29,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:29,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:26:29,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:29,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:26:29,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:29,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:26:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:29,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:26:29,360 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-08 16:26:29,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:26:29,390 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-08 16:26:29,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:26:29,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-08 16:26:29,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:26:29,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 16:26:29,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 16:26:29,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 16:26:29,406 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 6 states. [2018-12-08 16:26:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:29,429 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-08 16:26:29,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:26:29,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-08 16:26:29,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:29,430 INFO L225 Difference]: With dead ends: 107 [2018-12-08 16:26:29,430 INFO L226 Difference]: Without dead ends: 107 [2018-12-08 16:26:29,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 16:26:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-08 16:26:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-08 16:26:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-08 16:26:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-08 16:26:29,434 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 20 [2018-12-08 16:26:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:29,434 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-08 16:26:29,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 16:26:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-08 16:26:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 16:26:29,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:29,435 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:29,435 INFO L423 AbstractCegarLoop]: === Iteration 10 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:29,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1764624449, now seen corresponding path program 1 times [2018-12-08 16:26:29,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:29,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:29,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:29,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:29,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:26:29,483 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-08 16:26:29,483 INFO L205 CegarAbsIntRunner]: [0], [1], [104], [111], [117], [119], [122], [125], [134], [140], [142], [145], [147], [148], [160], [161], [162], [164] [2018-12-08 16:26:29,484 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:26:29,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:26:29,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:26:29,532 INFO L272 AbstractInterpreter]: Visited 18 different actions 36 times. Merged at 6 different actions 18 times. Never widened. Performed 398 root evaluator evaluations with a maximum evaluation depth of 3. Performed 398 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-12-08 16:26:29,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:29,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:26:29,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:29,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:26:29,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:29,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:26:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:29,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:26:29,572 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-08 16:26:29,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:29,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:29,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 16:26:29,611 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-08 16:26:29,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:29,615 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-08 16:26:29,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-08 16:26:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:29,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:26:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:29,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:26:29,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 5] total 8 [2018-12-08 16:26:29,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:26:29,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:26:29,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:26:29,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:26:29,699 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 5 states. [2018-12-08 16:26:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:29,731 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-08 16:26:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:26:29,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-12-08 16:26:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:29,732 INFO L225 Difference]: With dead ends: 105 [2018-12-08 16:26:29,732 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 16:26:29,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-08 16:26:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 16:26:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-08 16:26:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 16:26:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-08 16:26:29,734 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 21 [2018-12-08 16:26:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:29,734 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-08 16:26:29,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:26:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-08 16:26:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 16:26:29,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:29,735 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:29,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:29,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:29,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2013618610, now seen corresponding path program 1 times [2018-12-08 16:26:29,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:29,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:29,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:26:29,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:29,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:26:29,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:29,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:26:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:26:29,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:26:29,785 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 9 states. [2018-12-08 16:26:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:29,951 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-12-08 16:26:29,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:26:29,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-08 16:26:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:29,951 INFO L225 Difference]: With dead ends: 102 [2018-12-08 16:26:29,952 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 16:26:29,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:26:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 16:26:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-08 16:26:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 16:26:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-12-08 16:26:29,954 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 32 [2018-12-08 16:26:29,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:29,954 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-12-08 16:26:29,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:26:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-12-08 16:26:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 16:26:29,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:29,954 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:29,955 INFO L423 AbstractCegarLoop]: === Iteration 12 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:29,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2013618611, now seen corresponding path program 1 times [2018-12-08 16:26:29,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:29,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:26:30,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:30,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:26:30,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:30,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:26:30,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:26:30,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:26:30,015 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 9 states. [2018-12-08 16:26:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:30,137 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-08 16:26:30,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:26:30,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-08 16:26:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:30,138 INFO L225 Difference]: With dead ends: 95 [2018-12-08 16:26:30,138 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 16:26:30,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:26:30,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 16:26:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-08 16:26:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 16:26:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-12-08 16:26:30,140 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 32 [2018-12-08 16:26:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:30,140 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-12-08 16:26:30,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:26:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-12-08 16:26:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 16:26:30,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:30,141 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:30,141 INFO L423 AbstractCegarLoop]: === Iteration 13 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:30,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2091022798, now seen corresponding path program 1 times [2018-12-08 16:26:30,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:30,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:30,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:30,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:30,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:30,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:30,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:26:30,392 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-08 16:26:30,392 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [46], [49], [50], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:26:30,393 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:26:30,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:26:30,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:26:30,442 INFO L272 AbstractInterpreter]: Visited 33 different actions 56 times. Merged at 10 different actions 20 times. Never widened. Performed 558 root evaluator evaluations with a maximum evaluation depth of 3. Performed 558 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:26:30,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:30,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:26:30,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:30,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:26:30,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:30,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:26:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:30,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:26:30,511 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-08 16:26:30,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-12-08 16:26:30,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:30,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:30,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:30,586 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 16 treesize of output 9 [2018-12-08 16:26:30,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2018-12-08 16:26:30,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:26:30,618 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-08 16:26:30,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-12-08 16:26:30,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-08 16:26:30,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-08 16:26:30,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,684 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-08 16:26:30,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:42 [2018-12-08 16:26:30,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 59 [2018-12-08 16:26:30,765 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 48 treesize of output 47 [2018-12-08 16:26:30,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:30,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2018-12-08 16:26:30,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 47 [2018-12-08 16:26:30,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:30,855 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:30,855 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 32 treesize of output 66 [2018-12-08 16:26:30,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:30,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:30,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:86 [2018-12-08 16:26:31,116 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 75 [2018-12-08 16:26:31,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:31,119 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 67 treesize of output 33 [2018-12-08 16:26:31,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:31,141 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 13 [2018-12-08 16:26:31,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,154 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:93, output treesize:7 [2018-12-08 16:26:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:31,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:26:31,330 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-12-08 16:26:31,581 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 67 treesize of output 45 [2018-12-08 16:26:31,583 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 9 treesize of output 8 [2018-12-08 16:26:31,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,599 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2018-12-08 16:26:31,637 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 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 16:26:31,638 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:31,646 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 2 case distinctions, treesize of input 33 treesize of output 41 [2018-12-08 16:26:31,646 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:31,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 16:26:31,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:31,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 16:26:31,666 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:31,742 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 34 treesize of output 33 [2018-12-08 16:26:31,743 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,744 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 33 treesize of output 32 [2018-12-08 16:26:31,745 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,746 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 33 treesize of output 32 [2018-12-08 16:26:31,746 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,821 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-08 16:26:31,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:26:31,824 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,830 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 12 treesize of output 3 [2018-12-08 16:26:31,830 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,833 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-08 16:26:31,837 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 6 treesize of output 1 [2018-12-08 16:26:31,837 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:26:31,844 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,848 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-08 16:26:31,852 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 3 [2018-12-08 16:26:31,852 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:26:31,862 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,866 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-08 16:26:31,946 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 18 treesize of output 10 [2018-12-08 16:26:31,947 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,955 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:31,956 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 23 treesize of output 12 [2018-12-08 16:26:31,956 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,964 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:31,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2018-12-08 16:26:31,970 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:31,971 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 17 [2018-12-08 16:26:31,971 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,983 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 15 [2018-12-08 16:26:31,983 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:31,993 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:31,997 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 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-08 16:26:31,999 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:32,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 23 treesize of output 12 [2018-12-08 16:26:32,000 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:32,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-08 16:26:32,009 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:32,017 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:32,052 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 22 [2018-12-08 16:26:32,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:26:32,053 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:32,056 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:32,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:26:32,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:26:32,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:26:32,122 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 2 variables, input treesize:67, output treesize:46 [2018-12-08 16:26:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:32,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:26:32,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 41 [2018-12-08 16:26:32,330 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:26:32,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-08 16:26:32,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-08 16:26:32,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1580, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 16:26:32,331 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 35 states. [2018-12-08 16:26:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:33,535 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-12-08 16:26:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-08 16:26:33,535 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-12-08 16:26:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:33,536 INFO L225 Difference]: With dead ends: 93 [2018-12-08 16:26:33,536 INFO L226 Difference]: Without dead ends: 93 [2018-12-08 16:26:33,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=444, Invalid=2748, Unknown=0, NotChecked=0, Total=3192 [2018-12-08 16:26:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-08 16:26:33,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-12-08 16:26:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 16:26:33,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-12-08 16:26:33,539 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 38 [2018-12-08 16:26:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:33,539 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-12-08 16:26:33,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-08 16:26:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-12-08 16:26:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 16:26:33,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:33,540 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:33,540 INFO L423 AbstractCegarLoop]: === Iteration 14 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:33,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:33,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2091021902, now seen corresponding path program 1 times [2018-12-08 16:26:33,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:33,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:33,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:33,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:33,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:26:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:33,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 16:26:33,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:33,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 16:26:33,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 16:26:33,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-08 16:26:33,686 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 13 states. [2018-12-08 16:26:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:33,851 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-08 16:26:33,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 16:26:33,852 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-08 16:26:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:33,852 INFO L225 Difference]: With dead ends: 86 [2018-12-08 16:26:33,852 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 16:26:33,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-08 16:26:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 16:26:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-08 16:26:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 16:26:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-08 16:26:33,854 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 38 [2018-12-08 16:26:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:33,854 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-08 16:26:33,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 16:26:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-08 16:26:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 16:26:33,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:33,855 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:33,855 INFO L423 AbstractCegarLoop]: === Iteration 15 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:33,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash -397197215, now seen corresponding path program 1 times [2018-12-08 16:26:33,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:33,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:33,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:33,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:33,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:34,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:34,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:26:34,044 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-12-08 16:26:34,044 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [46], [49], [51], [52], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:26:34,045 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:26:34,045 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:26:34,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:26:34,082 INFO L272 AbstractInterpreter]: Visited 34 different actions 57 times. Merged at 10 different actions 20 times. Never widened. Performed 562 root evaluator evaluations with a maximum evaluation depth of 3. Performed 562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:26:34,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:34,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:26:34,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:34,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:26:34,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:34,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:26:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:34,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:26:34,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:34,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:34,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:34,134 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 16 treesize of output 9 [2018-12-08 16:26:34,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-12-08 16:26:34,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:26:34,157 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 8 treesize of output 7 [2018-12-08 16:26:34,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-08 16:26:34,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-12-08 16:26:34,183 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 14 treesize of output 13 [2018-12-08 16:26:34,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,191 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-08 16:26:34,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-12-08 16:26:34,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 16:26:34,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-12-08 16:26:34,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,271 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 39 treesize of output 38 [2018-12-08 16:26:34,272 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:34,287 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-12-08 16:26:34,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-08 16:26:34,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:34,326 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 35 treesize of output 46 [2018-12-08 16:26:34,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:34,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:60, output treesize:65 [2018-12-08 16:26:34,776 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 63 [2018-12-08 16:26:34,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2018-12-08 16:26:34,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,795 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 44 [2018-12-08 16:26:34,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,811 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 48 treesize of output 36 [2018-12-08 16:26:34,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:34,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:34,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-12-08 16:26:34,825 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-08 16:26:34,837 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-12-08 16:26:34,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:34,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 16:26:34,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 16:26:34,858 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:72, output treesize:27 [2018-12-08 16:26:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:34,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:26:35,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 84 [2018-12-08 16:26:35,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:35,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:35,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:81 [2018-12-08 16:26:35,342 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:26:35,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:35,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:35,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:145, output treesize:1 [2018-12-08 16:26:35,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 16:26:35,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 16:26:35,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [17, 18] total 31 [2018-12-08 16:26:35,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:35,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 16:26:35,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 16:26:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2018-12-08 16:26:35,380 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 13 states. [2018-12-08 16:26:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:36,021 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-12-08 16:26:36,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 16:26:36,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-12-08 16:26:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:36,022 INFO L225 Difference]: With dead ends: 85 [2018-12-08 16:26:36,022 INFO L226 Difference]: Without dead ends: 85 [2018-12-08 16:26:36,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 16:26:36,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-08 16:26:36,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-08 16:26:36,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-08 16:26:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-12-08 16:26:36,024 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 39 [2018-12-08 16:26:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:36,024 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-12-08 16:26:36,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 16:26:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-12-08 16:26:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 16:26:36,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:36,025 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:36,025 INFO L423 AbstractCegarLoop]: === Iteration 16 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:36,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash -397169411, now seen corresponding path program 1 times [2018-12-08 16:26:36,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:36,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:36,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:36,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:26:36,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:26:36,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 16:26:36,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 16:26:36,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 16:26:36,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 16:26:36,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-08 16:26:36,142 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 14 states. [2018-12-08 16:26:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:36,370 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-12-08 16:26:36,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 16:26:36,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-12-08 16:26:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:36,371 INFO L225 Difference]: With dead ends: 84 [2018-12-08 16:26:36,371 INFO L226 Difference]: Without dead ends: 84 [2018-12-08 16:26:36,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2018-12-08 16:26:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-08 16:26:36,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-08 16:26:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-08 16:26:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-12-08 16:26:36,373 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-12-08 16:26:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:36,374 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-12-08 16:26:36,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 16:26:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-12-08 16:26:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 16:26:36,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:36,375 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:36,375 INFO L423 AbstractCegarLoop]: === Iteration 17 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:36,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash -283711699, now seen corresponding path program 1 times [2018-12-08 16:26:36,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:36,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:36,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:36,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:36,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:36,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:26:36,566 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-08 16:26:36,566 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [18], [20], [22], [35], [37], [38], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:26:36,567 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:26:36,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:26:36,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:26:36,613 INFO L272 AbstractInterpreter]: Visited 36 different actions 59 times. Merged at 10 different actions 20 times. Never widened. Performed 535 root evaluator evaluations with a maximum evaluation depth of 3. Performed 535 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:26:36,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:36,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:26:36,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:36,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:26:36,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:36,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:26:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:36,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:26:36,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:36,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:36,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 16:26:36,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:36,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:36,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 16:26:36,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 16:26:36,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 16:26:36,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:36,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:36,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:36,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:28 [2018-12-08 16:26:36,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 31 treesize of output 25 [2018-12-08 16:26:36,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2018-12-08 16:26:36,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 16:26:36,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 16:26:36,877 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 2 xjuncts. [2018-12-08 16:26:36,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-12-08 16:26:36,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:36,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 16:26:36,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:36,996 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-08 16:26:36,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-08 16:26:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:37,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:26:37,334 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 17 [2018-12-08 16:26:37,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2018-12-08 16:26:37,343 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-08 16:26:37,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 16:26:37,362 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 3 xjuncts. [2018-12-08 16:26:37,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:51 [2018-12-08 16:26:37,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-08 16:26:37,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:37,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-12-08 16:26:37,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:37,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 16:26:37,412 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:37,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:26:37,416 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2018-12-08 16:26:37,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:37,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:37,466 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 3 [2018-12-08 16:26:37,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:37,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:37,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:3 [2018-12-08 16:26:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:37,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:26:37,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 42 [2018-12-08 16:26:37,485 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:26:37,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-08 16:26:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-08 16:26:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1663, Unknown=0, NotChecked=0, Total=1806 [2018-12-08 16:26:37,486 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 32 states. [2018-12-08 16:26:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:39,187 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-12-08 16:26:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 16:26:39,188 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-12-08 16:26:39,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:39,189 INFO L225 Difference]: With dead ends: 83 [2018-12-08 16:26:39,189 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 16:26:39,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=277, Invalid=2479, Unknown=0, NotChecked=0, Total=2756 [2018-12-08 16:26:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 16:26:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-08 16:26:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 16:26:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-12-08 16:26:39,194 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 41 [2018-12-08 16:26:39,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:39,194 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-12-08 16:26:39,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-08 16:26:39,194 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-12-08 16:26:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 16:26:39,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:39,194 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:39,195 INFO L423 AbstractCegarLoop]: === Iteration 18 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:39,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:39,195 INFO L82 PathProgramCache]: Analyzing trace with hash -283721629, now seen corresponding path program 1 times [2018-12-08 16:26:39,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:39,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:39,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:39,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:39,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:39,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:26:39,426 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-12-08 16:26:39,426 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [18], [20], [22], [25], [27], [28], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:26:39,427 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:26:39,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:26:39,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:26:39,465 INFO L272 AbstractInterpreter]: Visited 36 different actions 59 times. Merged at 10 different actions 20 times. Never widened. Performed 541 root evaluator evaluations with a maximum evaluation depth of 3. Performed 541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:26:39,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:39,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:26:39,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:39,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:26:39,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:39,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:26:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:39,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:26:39,538 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-08 16:26:39,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 16:26:39,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:39,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:39,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:39,549 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 16 treesize of output 9 [2018-12-08 16:26:39,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2018-12-08 16:26:39,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:26:39,569 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 8 treesize of output 7 [2018-12-08 16:26:39,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-08 16:26:39,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 16:26:39,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 16:26:39,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:39,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:38 [2018-12-08 16:26:39,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 16:26:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-12-08 16:26:39,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:39,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-08 16:26:39,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-08 16:26:39,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:39,755 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 35 treesize of output 46 [2018-12-08 16:26:39,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:39,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:39,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:57 [2018-12-08 16:26:39,983 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2018-12-08 16:26:39,985 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 44 [2018-12-08 16:26:39,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:40,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2018-12-08 16:26:40,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 16:26:40,041 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 29 treesize of output 22 [2018-12-08 16:26:40,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:40,042 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 23 treesize of output 16 [2018-12-08 16:26:40,043 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:40,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-08 16:26:40,045 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:40,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:40,083 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 39 treesize of output 50 [2018-12-08 16:26:40,084 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-12-08 16:26:40,130 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 22 treesize of output 10 [2018-12-08 16:26:40,131 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:40,133 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 32 treesize of output 20 [2018-12-08 16:26:40,133 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:40,135 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 30 treesize of output 18 [2018-12-08 16:26:40,135 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:40,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-08 16:26:40,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-12-08 16:26:40,183 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:67, output treesize:90 [2018-12-08 16:26:40,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:40,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 16:26:40,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:40,306 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-08 16:26:40,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-08 16:26:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:40,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:26:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-12-08 16:26:41,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:41,090 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 48 treesize of output 41 [2018-12-08 16:26:41,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:41,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-08 16:26:41,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:102 [2018-12-08 16:26:41,264 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 86 treesize of output 63 [2018-12-08 16:26:41,265 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 9 treesize of output 8 [2018-12-08 16:26:41,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:41,290 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2018-12-08 16:26:41,292 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 43 treesize of output 42 [2018-12-08 16:26:41,293 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:41,315 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 42 treesize of output 43 [2018-12-08 16:26:41,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:41,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 75 [2018-12-08 16:26:41,384 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 49 treesize of output 48 [2018-12-08 16:26:41,384 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:41,490 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:41,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 69 [2018-12-08 16:26:41,499 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-12-08 16:26:41,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:41,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 51 [2018-12-08 16:26:41,657 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:41,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 66 [2018-12-08 16:26:41,831 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:42,005 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 44 treesize of output 36 [2018-12-08 16:26:42,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-12-08 16:26:42,023 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,027 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,182 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2018-12-08 16:26:42,245 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:42,246 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:42,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2018-12-08 16:26:42,248 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:42,249 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:26:42,250 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,299 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 29 treesize of output 46 [2018-12-08 16:26:42,299 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-12-08 16:26:42,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-12-08 16:26:42,325 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-12-08 16:26:42,355 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-12-08 16:26:42,371 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:26:42,482 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 47 treesize of output 39 [2018-12-08 16:26:42,503 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:42,503 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:42,503 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:42,506 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:42,506 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 26 treesize of output 18 [2018-12-08 16:26:42,506 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,512 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,708 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 2 case distinctions, treesize of input 45 treesize of output 47 [2018-12-08 16:26:42,754 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:26:42,754 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-12-08 16:26:42,760 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:42,784 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 26 treesize of output 18 [2018-12-08 16:26:42,785 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-12-08 16:26:42,802 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:42,812 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:42,819 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 2 case distinctions, treesize of input 47 treesize of output 47 [2018-12-08 16:26:42,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2018-12-08 16:26:42,886 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:42,887 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:26:42,887 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,907 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:42,908 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:42,908 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 20 [2018-12-08 16:26:42,909 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:42,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-12-08 16:26:42,935 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 3 xjuncts. [2018-12-08 16:26:42,951 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:43,006 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:26:43,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:26:43,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:26:43,144 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 87 treesize of output 64 [2018-12-08 16:26:43,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-08 16:26:43,147 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,187 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2018-12-08 16:26:43,190 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 44 treesize of output 43 [2018-12-08 16:26:43,191 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,223 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 43 treesize of output 44 [2018-12-08 16:26:43,224 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,253 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2018-12-08 16:26:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-12-08 16:26:43,255 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 45 treesize of output 48 [2018-12-08 16:26:43,281 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 45 [2018-12-08 16:26:43,347 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 33 treesize of output 13 [2018-12-08 16:26:43,347 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 4 [2018-12-08 16:26:43,364 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,366 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,372 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 75 [2018-12-08 16:26:43,414 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 47 treesize of output 46 [2018-12-08 16:26:43,414 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:43,503 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 2 case distinctions, treesize of input 46 treesize of output 55 [2018-12-08 16:26:43,503 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:43,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 46 treesize of output 47 [2018-12-08 16:26:43,601 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:43,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-12-08 16:26:43,701 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:43,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:43,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 53 [2018-12-08 16:26:43,901 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 32 treesize of output 30 [2018-12-08 16:26:43,901 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:43,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2018-12-08 16:26:43,946 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:43,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2018-12-08 16:26:43,981 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:44,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2018-12-08 16:26:44,014 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:44,026 INFO L267 ElimStorePlain]: Start of recursive call 48: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:26:44,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 45 [2018-12-08 16:26:44,259 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,261 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 49 [2018-12-08 16:26:44,326 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:26:44,326 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:44,328 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,330 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,330 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,332 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2018-12-08 16:26:44,332 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:44,358 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,360 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 37 treesize of output 22 [2018-12-08 16:26:44,360 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:44,375 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:44,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 31 [2018-12-08 16:26:44,420 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:44,435 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:26:44,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2018-12-08 16:26:44,555 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 25 [2018-12-08 16:26:44,556 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:44,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 31 [2018-12-08 16:26:44,586 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:44,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 16:26:44,601 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:44,607 INFO L267 ElimStorePlain]: Start of recursive call 59: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:44,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 57 [2018-12-08 16:26:44,834 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 137 [2018-12-08 16:26:44,836 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,836 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2018-12-08 16:26:44,837 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:44,921 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 21 treesize of output 13 [2018-12-08 16:26:44,921 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:44,982 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,983 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,983 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,984 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 15 [2018-12-08 16:26:44,984 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:44,985 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,985 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:26:44,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-12-08 16:26:44,986 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:45,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 22 [2018-12-08 16:26:45,045 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:45,087 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 22 [2018-12-08 16:26:45,087 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:45,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 16:26:45,134 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:45,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2018-12-08 16:26:45,203 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:45,228 INFO L267 ElimStorePlain]: Start of recursive call 63: 10 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:26:45,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 42 [2018-12-08 16:26:45,328 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:26:45,328 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:45,330 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 32 treesize of output 20 [2018-12-08 16:26:45,330 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:45,343 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 12 [2018-12-08 16:26:45,343 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:45,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 9 [2018-12-08 16:26:45,355 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:45,359 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:45,370 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:26:45,379 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:26:45,386 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:26:45,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:26:45,437 INFO L202 ElimStorePlain]: Needed 76 recursive calls to eliminate 10 variables, input treesize:174, output treesize:79 [2018-12-08 16:26:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:45,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:26:45,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 49 [2018-12-08 16:26:45,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:26:45,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 16:26:45,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 16:26:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2306, Unknown=0, NotChecked=0, Total=2450 [2018-12-08 16:26:45,666 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 33 states. [2018-12-08 16:26:47,706 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2018-12-08 16:26:48,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:48,299 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-08 16:26:48,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 16:26:48,300 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 41 [2018-12-08 16:26:48,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:48,300 INFO L225 Difference]: With dead ends: 86 [2018-12-08 16:26:48,300 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 16:26:48,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=520, Invalid=4592, Unknown=0, NotChecked=0, Total=5112 [2018-12-08 16:26:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 16:26:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-12-08 16:26:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 16:26:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-12-08 16:26:48,303 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 41 [2018-12-08 16:26:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:48,303 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-12-08 16:26:48,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 16:26:48,303 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-12-08 16:26:48,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 16:26:48,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:48,304 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:48,304 INFO L423 AbstractCegarLoop]: === Iteration 19 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:48,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:48,304 INFO L82 PathProgramCache]: Analyzing trace with hash -267236191, now seen corresponding path program 1 times [2018-12-08 16:26:48,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:48,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:48,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:48,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:48,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:48,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:48,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:26:48,604 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-08 16:26:48,604 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [46], [49], [51], [53], [66], [68], [69], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:26:48,605 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:26:48,605 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:26:48,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:26:48,638 INFO L272 AbstractInterpreter]: Visited 37 different actions 60 times. Merged at 10 different actions 20 times. Never widened. Performed 542 root evaluator evaluations with a maximum evaluation depth of 3. Performed 542 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:26:48,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:48,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:26:48,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:48,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:26:48,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:48,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:26:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:48,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:26:48,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:48,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:48,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 16:26:48,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-12-08 16:26:48,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:48,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:48,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:48,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 16:26:48,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-12-08 16:26:48,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-08 16:26:48,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 16:26:48,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-12-08 16:26:48,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-08 16:26:48,774 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 14 treesize of output 13 [2018-12-08 16:26:48,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,783 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-08 16:26:48,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-12-08 16:26:48,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-08 16:26:48,836 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 8 treesize of output 7 [2018-12-08 16:26:48,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:48,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-12-08 16:26:48,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-12-08 16:26:48,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:48,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-12-08 16:26:48,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:48,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:48,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:70 [2018-12-08 16:26:49,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 58 [2018-12-08 16:26:49,243 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-08 16:26:49,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:49,250 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 46 treesize of output 24 [2018-12-08 16:26:49,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:49,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 5 treesize of output 1 [2018-12-08 16:26:49,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:49,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:49,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:49,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:10 [2018-12-08 16:26:49,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:49,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 16:26:49,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:49,283 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-08 16:26:49,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-08 16:26:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:49,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:26:49,680 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 6 treesize of output 1 [2018-12-08 16:26:49,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:49,681 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-08 16:26:49,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-12-08 16:26:51,613 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 37 treesize of output 31 [2018-12-08 16:26:51,616 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 9 treesize of output 8 [2018-12-08 16:26:51,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:51,629 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-12-08 16:26:51,631 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 34 treesize of output 33 [2018-12-08 16:26:51,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:51,650 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 33 treesize of output 39 [2018-12-08 16:26:51,651 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:51,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-12-08 16:26:51,680 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 8 [2018-12-08 16:26:51,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:51,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2018-12-08 16:26:51,690 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-08 16:26:51,693 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:51,701 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 15 [2018-12-08 16:26:51,702 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 6 treesize of output 1 [2018-12-08 16:26:51,702 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:51,704 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:51,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:51,712 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-08 16:26:51,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:26:51,716 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:37, output treesize:9 [2018-12-08 16:26:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:51,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:26:51,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 20] total 54 [2018-12-08 16:26:51,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:26:51,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-08 16:26:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-08 16:26:51,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2778, Unknown=0, NotChecked=0, Total=2970 [2018-12-08 16:26:51,940 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 42 states. [2018-12-08 16:26:53,518 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-12-08 16:26:53,953 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2018-12-08 16:26:54,266 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2018-12-08 16:26:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:26:54,827 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-12-08 16:26:54,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 16:26:54,827 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-08 16:26:54,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:26:54,828 INFO L225 Difference]: With dead ends: 83 [2018-12-08 16:26:54,828 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 16:26:54,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=554, Invalid=5146, Unknown=0, NotChecked=0, Total=5700 [2018-12-08 16:26:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 16:26:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-12-08 16:26:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-08 16:26:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-12-08 16:26:54,831 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 42 [2018-12-08 16:26:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:26:54,831 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-12-08 16:26:54,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-08 16:26:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-12-08 16:26:54,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 16:26:54,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:26:54,832 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:26:54,832 INFO L423 AbstractCegarLoop]: === Iteration 20 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:26:54,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash -267246121, now seen corresponding path program 1 times [2018-12-08 16:26:54,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:26:54,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:54,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:26:54,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:26:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:26:55,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:55,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:26:55,034 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-08 16:26:55,034 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [46], [49], [51], [53], [56], [58], [59], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:26:55,035 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:26:55,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:26:55,062 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:26:55,062 INFO L272 AbstractInterpreter]: Visited 37 different actions 60 times. Merged at 10 different actions 20 times. Never widened. Performed 542 root evaluator evaluations with a maximum evaluation depth of 3. Performed 542 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:26:55,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:26:55,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:26:55,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:26:55,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:26:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:26:55,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:26:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:26:55,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:26:55,124 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-08 16:26:55,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 16:26:55,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:55,135 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:55,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:26:55,136 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 16 treesize of output 9 [2018-12-08 16:26:55,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2018-12-08 16:26:55,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:26:55,158 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 8 treesize of output 7 [2018-12-08 16:26:55,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,165 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-08 16:26:55,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-12-08 16:26:55,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-08 16:26:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 16:26:55,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:55,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-08 16:26:55,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-08 16:26:55,265 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 35 treesize of output 36 [2018-12-08 16:26:55,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,280 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 30 treesize of output 29 [2018-12-08 16:26:55,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:26:55,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 16:26:55,292 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:39 [2018-12-08 16:26:55,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-12-08 16:26:55,332 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 36 [2018-12-08 16:26:55,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 16:26:55,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 16:26:55,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-08 16:26:55,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:99 [2018-12-08 16:27:05,427 WARN L180 SmtUtils]: Spent 10.03 s on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2018-12-08 16:27:07,463 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 16:27:09,502 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 16:27:11,542 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 16:27:13,586 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 16:27:15,626 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 16:27:17,669 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-08 16:27:17,680 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 45 [2018-12-08 16:27:17,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, 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 31 [2018-12-08 16:27:17,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:17,697 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 1 case distinctions, treesize of input 27 treesize of output 24 [2018-12-08 16:27:17,697 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 16:27:17,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2018-12-08 16:27:17,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 16:27:17,739 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 19 treesize of output 6 [2018-12-08 16:27:17,739 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:17,741 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 17 treesize of output 4 [2018-12-08 16:27:17,741 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:17,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:27:17,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:27:17,756 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:62, output treesize:32 [2018-12-08 16:27:17,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:27:17,834 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 19 treesize of output 24 [2018-12-08 16:27:17,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:17,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:27:17,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 16:27:17,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 16:27:17,860 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 3 xjuncts. [2018-12-08 16:27:17,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:38 [2018-12-08 16:27:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:27:17,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:27:18,088 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 6 treesize of output 1 [2018-12-08 16:27:18,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:18,092 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-08 16:27:18,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-12-08 16:27:18,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-08 16:27:18,715 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 9 treesize of output 8 [2018-12-08 16:27:18,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:18,730 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 50 [2018-12-08 16:27:18,733 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 36 treesize of output 35 [2018-12-08 16:27:18,733 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:18,752 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 35 treesize of output 36 [2018-12-08 16:27:18,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:18,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-12-08 16:27:18,790 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 14 [2018-12-08 16:27:18,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:18,792 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:27:18,792 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:27:18,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-12-08 16:27:18,793 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:27:18,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2018-12-08 16:27:18,815 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-08 16:27:18,825 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 26 treesize of output 24 [2018-12-08 16:27:18,825 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 16:27:18,837 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:27:18,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:27:18,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:27:18,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:27:18,879 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:50, output treesize:33 [2018-12-08 16:27:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:27:19,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:27:19,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 54 [2018-12-08 16:27:19,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:27:19,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-08 16:27:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-08 16:27:19,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2788, Unknown=0, NotChecked=0, Total=2970 [2018-12-08 16:27:19,080 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 37 states. [2018-12-08 16:27:23,850 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 54 [2018-12-08 16:27:27,970 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 73 [2018-12-08 16:27:30,085 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-08 16:27:32,131 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-08 16:27:34,182 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-08 16:27:38,247 WARN L180 SmtUtils]: Spent 4.01 s on a formula simplification that was a NOOP. DAG size: 52 [2018-12-08 16:27:46,341 WARN L180 SmtUtils]: Spent 8.03 s on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-12-08 16:27:54,444 WARN L180 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-12-08 16:28:02,542 WARN L180 SmtUtils]: Spent 8.04 s on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-12-08 16:28:10,686 WARN L180 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-12-08 16:28:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:10,921 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-12-08 16:28:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 16:28:10,922 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 42 [2018-12-08 16:28:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:10,922 INFO L225 Difference]: With dead ends: 82 [2018-12-08 16:28:10,922 INFO L226 Difference]: Without dead ends: 82 [2018-12-08 16:28:10,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 72.6s TimeCoverageRelationStatistics Valid=596, Invalid=5410, Unknown=0, NotChecked=0, Total=6006 [2018-12-08 16:28:10,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-08 16:28:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-08 16:28:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 16:28:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-12-08 16:28:10,924 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 42 [2018-12-08 16:28:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:10,924 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-12-08 16:28:10,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-08 16:28:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-12-08 16:28:10,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 16:28:10,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:10,925 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:10,925 INFO L423 AbstractCegarLoop]: === Iteration 21 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:28:10,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:10,925 INFO L82 PathProgramCache]: Analyzing trace with hash 561090647, now seen corresponding path program 1 times [2018-12-08 16:28:10,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:28:10,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:28:10,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:10,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:28:10,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:28:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:11,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:28:11,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:28:11,065 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-08 16:28:11,065 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [46], [77], [79], [81], [84], [86], [87], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:28:11,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:28:11,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:28:11,094 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:28:11,094 INFO L272 AbstractInterpreter]: Visited 37 different actions 60 times. Merged at 10 different actions 20 times. Never widened. Performed 576 root evaluator evaluations with a maximum evaluation depth of 3. Performed 576 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:28:11,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:11,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:28:11,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:28:11,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:28:11,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:11,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:28:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:11,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:11,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:11,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:11,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 16:28:11,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 16:28:11,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 16:28:11,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 16:28:11,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:11,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-12-08 16:28:11,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, 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-08 16:28:11,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2018-12-08 16:28:11,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:11,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:11,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:11,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:26 [2018-12-08 16:28:11,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:11,377 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 19 treesize of output 24 [2018-12-08 16:28:11,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:11,393 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 2 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 16:28:11,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:11,406 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 3 xjuncts. [2018-12-08 16:28:11,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2018-12-08 16:28:11,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:11,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:28:11,556 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 6 treesize of output 1 [2018-12-08 16:28:11,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,559 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-08 16:28:11,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:17 [2018-12-08 16:28:11,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-08 16:28:11,792 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 12 treesize of output 3 [2018-12-08 16:28:11,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:11,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:11,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-12-08 16:28:11,850 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:11,850 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:11,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, 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 3 [2018-12-08 16:28:11,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:11,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:3 [2018-12-08 16:28:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:11,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:28:11,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 43 [2018-12-08 16:28:11,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:28:11,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-08 16:28:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-08 16:28:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1744, Unknown=0, NotChecked=0, Total=1892 [2018-12-08 16:28:11,871 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 32 states. [2018-12-08 16:28:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:12,709 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-12-08 16:28:12,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 16:28:12,709 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2018-12-08 16:28:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:12,710 INFO L225 Difference]: With dead ends: 76 [2018-12-08 16:28:12,710 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 16:28:12,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 6 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=291, Invalid=2571, Unknown=0, NotChecked=0, Total=2862 [2018-12-08 16:28:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 16:28:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-08 16:28:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 16:28:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-12-08 16:28:12,711 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 42 [2018-12-08 16:28:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:12,711 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-12-08 16:28:12,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-08 16:28:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-12-08 16:28:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 16:28:12,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:12,712 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:12,712 INFO L423 AbstractCegarLoop]: === Iteration 22 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:28:12,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:12,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2064000817, now seen corresponding path program 1 times [2018-12-08 16:28:12,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:28:12,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:28:12,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:12,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:28:12,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:28:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:13,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:28:13,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:28:13,067 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-12-08 16:28:13,067 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [18], [20], [22], [35], [37], [39], [41], [42], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:28:13,068 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:28:13,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:28:13,098 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:28:13,098 INFO L272 AbstractInterpreter]: Visited 38 different actions 61 times. Merged at 10 different actions 20 times. Never widened. Performed 543 root evaluator evaluations with a maximum evaluation depth of 3. Performed 543 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:28:13,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:13,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:28:13,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:28:13,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:28:13,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:13,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:28:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:13,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:13,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:13,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:13,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 16:28:13,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 16:28:13,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:13,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:13,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:13,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-08 16:28:13,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,253 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-12-08 16:28:13,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:28:13,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 16:28:13,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-12-08 16:28:13,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-08 16:28:13,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 16:28:13,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:13,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-12-08 16:28:13,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-12-08 16:28:13,406 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 8 treesize of output 7 [2018-12-08 16:28:13,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:13,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:56 [2018-12-08 16:28:13,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-12-08 16:28:13,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:13,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-12-08 16:28:13,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:13,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:69, output treesize:74 [2018-12-08 16:28:13,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 68 [2018-12-08 16:28:13,836 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-08 16:28:13,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 16:28:13,844 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:13,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:13,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:13,864 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 66 [2018-12-08 16:28:13,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-08 16:28:13,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-08 16:28:13,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-08 16:28:13,959 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:211 [2018-12-08 16:28:14,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:14,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 16:28:14,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:14,259 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-08 16:28:14,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:19 [2018-12-08 16:28:14,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:14,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:14,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 36 [2018-12-08 16:28:14,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:14,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:14,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2018-12-08 16:28:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:14,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:28:15,442 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:28:16,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 93 treesize of output 87 [2018-12-08 16:28:16,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:16,442 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 54 treesize of output 48 [2018-12-08 16:28:16,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:16,444 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 55 treesize of output 50 [2018-12-08 16:28:16,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:16,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2018-12-08 16:28:16,464 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:152, output treesize:183 [2018-12-08 16:28:16,712 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 155 treesize of output 100 [2018-12-08 16:28:16,714 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 9 treesize of output 8 [2018-12-08 16:28:16,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:16,739 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 77 [2018-12-08 16:28:16,741 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 63 treesize of output 62 [2018-12-08 16:28:16,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:16,765 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 62 treesize of output 63 [2018-12-08 16:28:16,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:16,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 62 treesize of output 87 [2018-12-08 16:28:16,819 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:16,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 81 [2018-12-08 16:28:16,828 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:16,997 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 61 treesize of output 60 [2018-12-08 16:28:16,997 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:17,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 56 treesize of output 63 [2018-12-08 16:28:17,171 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,335 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 59 treesize of output 49 [2018-12-08 16:28:17,369 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:17,369 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,372 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 73 [2018-12-08 16:28:17,396 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:28:17,396 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:17,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 4 [2018-12-08 16:28:17,400 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,413 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 57 [2018-12-08 16:28:17,673 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:17,673 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,674 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 41 treesize of output 33 [2018-12-08 16:28:17,674 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,676 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 39 [2018-12-08 16:28:17,676 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 16:28:17,713 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,714 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,722 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 45 [2018-12-08 16:28:17,723 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:17,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-12-08 16:28:17,750 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,751 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,763 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 46 [2018-12-08 16:28:17,763 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:17,775 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 57 [2018-12-08 16:28:17,863 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:17,863 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,864 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,864 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,865 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 41 treesize of output 35 [2018-12-08 16:28:17,865 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,866 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,867 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,867 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 47 treesize of output 41 [2018-12-08 16:28:17,867 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,913 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,920 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 44 [2018-12-08 16:28:17,921 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:17,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-08 16:28:17,923 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:17,954 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:17,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 68 [2018-12-08 16:28:17,975 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 32 xjuncts. [2018-12-08 16:28:17,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2018-12-08 16:28:17,981 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:18,032 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:18,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 59 [2018-12-08 16:28:18,114 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:18,114 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:18,116 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 52 treesize of output 44 [2018-12-08 16:28:18,116 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:18,148 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,149 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,154 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 60 [2018-12-08 16:28:18,165 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 5 xjuncts. [2018-12-08 16:28:18,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2018-12-08 16:28:18,211 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:18,214 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 60 [2018-12-08 16:28:18,236 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:18,263 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:18,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 59 [2018-12-08 16:28:18,345 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,347 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,351 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,362 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 73 [2018-12-08 16:28:18,362 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 5 xjuncts. [2018-12-08 16:28:18,364 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:18,364 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:18,422 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,422 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-12-08 16:28:18,423 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:18,424 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,424 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,425 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 31 treesize of output 22 [2018-12-08 16:28:18,425 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:18,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:18,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2018-12-08 16:28:18,463 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:18,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 85 [2018-12-08 16:28:18,496 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-08 16:28:18,497 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:18,534 INFO L267 ElimStorePlain]: Start of recursive call 37: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:18,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:18,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 63 [2018-12-08 16:28:18,809 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2018-12-08 16:28:18,812 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:18,812 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:18,814 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,827 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:18,854 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 13 case distinctions, treesize of input 40 treesize of output 77 [2018-12-08 16:28:18,857 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,862 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 52 [2018-12-08 16:28:18,872 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:18,934 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,938 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:18,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 79 [2018-12-08 16:28:18,958 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 16:28:18,960 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:19,020 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:19,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 37 treesize of output 84 [2018-12-08 16:28:19,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-08 16:28:19,053 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:19,107 INFO L267 ElimStorePlain]: Start of recursive call 46: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:19,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 27 [2018-12-08 16:28:19,185 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:19,187 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:19,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 81 [2018-12-08 16:28:19,215 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-08 16:28:19,216 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:19,276 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:19,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, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 61 [2018-12-08 16:28:19,292 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:19,378 INFO L267 ElimStorePlain]: Start of recursive call 44: 4 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-08 16:28:19,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 51 [2018-12-08 16:28:19,602 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:19,612 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 29 treesize of output 40 [2018-12-08 16:28:19,613 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:19,615 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:19,615 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-12-08 16:28:19,617 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:19,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:19,681 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 29 [2018-12-08 16:28:19,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 19 [2018-12-08 16:28:19,694 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:19,703 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:19,707 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:19,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:19,760 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 14 case distinctions, treesize of input 33 treesize of output 70 [2018-12-08 16:28:19,763 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:19,768 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:19,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 14 [2018-12-08 16:28:19,768 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:19,809 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:19,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 46 [2018-12-08 16:28:19,825 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:19,844 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:19,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 90 [2018-12-08 16:28:19,874 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-12-08 16:28:19,877 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 32 xjuncts. [2018-12-08 16:28:19,930 INFO L267 ElimStorePlain]: Start of recursive call 59: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:19,940 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:20,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 66 [2018-12-08 16:28:20,785 WARN L180 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 186 [2018-12-08 16:28:20,788 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:20,788 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:20,790 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:20,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-12-08 16:28:20,791 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:20,792 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:20,793 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:20,795 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:20,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 89 [2018-12-08 16:28:20,835 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-08 16:28:20,837 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:21,098 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 26 treesize of output 18 [2018-12-08 16:28:21,098 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:21,099 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2018-12-08 16:28:21,104 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:21,105 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,106 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-12-08 16:28:21,106 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:21,107 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,122 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 52 [2018-12-08 16:28:21,123 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:21,249 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,251 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,252 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,255 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 74 [2018-12-08 16:28:21,272 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 5 xjuncts. [2018-12-08 16:28:21,368 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,383 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 52 [2018-12-08 16:28:21,384 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:21,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-08 16:28:21,549 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:21,614 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2018-12-08 16:28:21,619 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:21,687 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,701 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 61 [2018-12-08 16:28:21,703 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 16 xjuncts. [2018-12-08 16:28: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 16 treesize of output 10 [2018-12-08 16:28:21,812 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:21,870 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:21,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 81 [2018-12-08 16:28:21,900 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-08 16:28:21,902 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 16 xjuncts. [2018-12-08 16:28:21,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 27 [2018-12-08 16:28:21,914 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:21,965 INFO L267 ElimStorePlain]: Start of recursive call 63: 10 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:28:22,039 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 16:28:22,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 16:28:22,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-08 16:28:22,194 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 83 treesize of output 60 [2018-12-08 16:28:22,197 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 9 treesize of output 8 [2018-12-08 16:28:22,198 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,238 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2018-12-08 16:28:22,245 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 42 treesize of output 43 [2018-12-08 16:28:22,245 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 42 [2018-12-08 16:28:22,296 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 59 [2018-12-08 16:28:22,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 47 treesize of output 46 [2018-12-08 16:28:22,399 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 44 treesize of output 47 [2018-12-08 16:28:22,536 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,642 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 47 treesize of output 43 [2018-12-08 16:28:22,665 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,667 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,668 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,669 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-12-08 16:28:22,670 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,676 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,703 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 2 case distinctions, treesize of input 43 treesize of output 43 [2018-12-08 16:28:22,742 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,743 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,744 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,745 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,745 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 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-08 16:28:22,746 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,747 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:22,747 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,749 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,750 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,751 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,751 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-08 16:28:22,751 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,770 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 33 treesize of output 27 [2018-12-08 16:28:22,770 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,781 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,782 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,782 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:22,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-12-08 16:28:22,783 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,792 INFO L267 ElimStorePlain]: Start of recursive call 89: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:22,819 INFO L267 ElimStorePlain]: Start of recursive call 84: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:22,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 74 [2018-12-08 16:28:22,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:22,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 51 [2018-12-08 16:28:22,870 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:22,965 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 46 treesize of output 45 [2018-12-08 16:28:22,965 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:23,071 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:23,077 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 2 case distinctions, treesize of input 45 treesize of output 54 [2018-12-08 16:28:23,077 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2018-12-08 16:28:23,251 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:23,381 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 2 case distinctions, treesize of input 46 treesize of output 44 [2018-12-08 16:28:23,400 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:23,402 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:23,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 48 [2018-12-08 16:28:23,447 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:23,448 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:23,450 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:23,457 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 2 case distinctions, treesize of input 33 treesize of output 43 [2018-12-08 16:28:23,457 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:23,458 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:23,458 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:23,479 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:23,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 43 [2018-12-08 16:28:23,487 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:23,502 INFO L267 ElimStorePlain]: Start of recursive call 101: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:23,540 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 30 treesize of output 47 [2018-12-08 16:28:23,540 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:23,559 INFO L267 ElimStorePlain]: Start of recursive call 100: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:23,756 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 2 case distinctions, treesize of input 39 treesize of output 41 [2018-12-08 16:28:23,962 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2018-12-08 16:28:23,967 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:23,968 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:23,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-08 16:28:23,973 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:24,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-12-08 16:28:24,053 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:24,076 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2018-12-08 16:28:24,076 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:24,087 INFO L267 ElimStorePlain]: Start of recursive call 106: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:24,094 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 2 case distinctions, treesize of input 43 treesize of output 43 [2018-12-08 16:28:24,141 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 33 treesize of output 25 [2018-12-08 16:28:24,141 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:24,142 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:24,142 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:24,163 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:24,164 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:24,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 16:28:24,168 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:24,201 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 30 treesize of output 47 [2018-12-08 16:28:24,202 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:24,218 INFO L267 ElimStorePlain]: Start of recursive call 111: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:24,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2018-12-08 16:28:24,459 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-12-08 16:28:24,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 52 [2018-12-08 16:28:24,557 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:24,712 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 33 treesize of output 19 [2018-12-08 16:28:24,712 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:24,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-08 16:28:24,816 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:24,870 INFO L267 ElimStorePlain]: Start of recursive call 116: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:25,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:25,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 52 [2018-12-08 16:28:25,681 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 69 [2018-12-08 16:28:25,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2018-12-08 16:28:25,742 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:25,747 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:25,747 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:25,909 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 26 treesize of output 43 [2018-12-08 16:28:25,909 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:25,973 INFO L267 ElimStorePlain]: Start of recursive call 120: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:26,165 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 3 case distinctions, treesize of input 39 treesize of output 55 [2018-12-08 16:28:26,806 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 134 [2018-12-08 16:28:26,812 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:26,813 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:26,819 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 35 treesize of output 30 [2018-12-08 16:28:26,820 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:27,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 39 [2018-12-08 16:28:27,494 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:27,995 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 29 treesize of output 46 [2018-12-08 16:28:27,997 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:28,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-08 16:28:28,434 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:28,832 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 21 treesize of output 13 [2018-12-08 16:28:28,833 INFO L267 ElimStorePlain]: Start of recursive call 130: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:29,258 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 29 treesize of output 46 [2018-12-08 16:28:29,259 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:29,630 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 26 treesize of output 43 [2018-12-08 16:28:29,632 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 3 xjuncts. [2018-12-08 16:28:29,872 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 32 treesize of output 18 [2018-12-08 16:28:29,872 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:30,068 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-08 16:28:30,069 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:30,235 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 29 treesize of output 21 [2018-12-08 16:28:30,236 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:30,496 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:30,500 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:30,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-12-08 16:28:30,515 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:30,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 22 treesize of output 16 [2018-12-08 16:28:30,610 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:30,696 INFO L267 ElimStorePlain]: Start of recursive call 124: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:30,943 INFO L267 ElimStorePlain]: Start of recursive call 95: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:31,081 INFO L267 ElimStorePlain]: Start of recursive call 81: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:31,178 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:31,626 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 61 [2018-12-08 16:28:31,631 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 9 treesize of output 8 [2018-12-08 16:28:31,631 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:31,704 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2018-12-08 16:28:31,710 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 44 treesize of output 43 [2018-12-08 16:28:31,710 INFO L267 ElimStorePlain]: Start of recursive call 141: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:31,795 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 43 treesize of output 44 [2018-12-08 16:28:31,795 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:31,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 76 [2018-12-08 16:28:31,942 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 50 treesize of output 49 [2018-12-08 16:28:31,942 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,316 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 70 [2018-12-08 16:28:32,347 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:32,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:32,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 45 treesize of output 52 [2018-12-08 16:28:32,713 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,859 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 43 [2018-12-08 16:28:32,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:28:32,879 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-08 16:28:32,888 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,891 INFO L267 ElimStorePlain]: Start of recursive call 147: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,893 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,893 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 53 treesize of output 48 [2018-12-08 16:28:32,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:28:32,914 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,923 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,923 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,924 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,924 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 19 treesize of output 10 [2018-12-08 16:28:32,924 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,929 INFO L267 ElimStorePlain]: Start of recursive call 150: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,931 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,931 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 51 treesize of output 46 [2018-12-08 16:28:32,956 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,956 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,956 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 15 treesize of output 9 [2018-12-08 16:28:32,956 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-12-08 16:28:32,969 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,974 INFO L267 ElimStorePlain]: Start of recursive call 153: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:32,977 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 55 treesize of output 45 [2018-12-08 16:28:32,997 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,997 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:32,998 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 15 treesize of output 9 [2018-12-08 16:28:32,998 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:33,007 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:33,008 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:33,009 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:33,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-12-08 16:28:33,009 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:33,014 INFO L267 ElimStorePlain]: Start of recursive call 156: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:33,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 50 [2018-12-08 16:28:33,169 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:33,169 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:33,170 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:33,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-12-08 16:28:33,171 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:33,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:33,205 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 41 [2018-12-08 16:28:33,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:33,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2018-12-08 16:28:33,211 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:33,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 31 [2018-12-08 16:28:33,235 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:33,243 INFO L267 ElimStorePlain]: Start of recursive call 161: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:33,252 INFO L267 ElimStorePlain]: Start of recursive call 159: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:33,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:33,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 67 [2018-12-08 16:28:33,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:33,524 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 42 [2018-12-08 16:28:33,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:33,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2018-12-08 16:28:33,529 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:33,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2018-12-08 16:28:33,552 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:33,558 INFO L267 ElimStorePlain]: Start of recursive call 165: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:33,559 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:33,560 INFO L267 ElimStorePlain]: Start of recursive call 168: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:33,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 25 [2018-12-08 16:28:33,594 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:33,613 INFO L267 ElimStorePlain]: Start of recursive call 164: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:33,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 63 [2018-12-08 16:28:34,029 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 121 [2018-12-08 16:28:34,031 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:34,032 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:34,032 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 27 treesize of output 18 [2018-12-08 16:28:34,032 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:34,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 25 [2018-12-08 16:28:34,166 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:34,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:34,272 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 37 [2018-12-08 16:28:34,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:34,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 4 [2018-12-08 16:28:34,279 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:34,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2018-12-08 16:28:34,304 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:34,310 INFO L267 ElimStorePlain]: Start of recursive call 173: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:34,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 16:28:34,405 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:34,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-12-08 16:28:34,410 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:34,441 INFO L267 ElimStorePlain]: Start of recursive call 170: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 16:28:34,471 INFO L267 ElimStorePlain]: Start of recursive call 143: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:34,486 INFO L267 ElimStorePlain]: Start of recursive call 140: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:34,493 INFO L267 ElimStorePlain]: Start of recursive call 138: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:34,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-12-08 16:28:34,572 INFO L202 ElimStorePlain]: Needed 177 recursive calls to eliminate 12 variables, input treesize:323, output treesize:134 [2018-12-08 16:28:35,330 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:35,334 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:35,336 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:35,337 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 23 treesize of output 11 [2018-12-08 16:28:35,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:35,390 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:35,393 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:35,393 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:35,394 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 19 treesize of output 7 [2018-12-08 16:28:35,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:35,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:35,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:12 [2018-12-08 16:28:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:35,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:28:35,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 69 [2018-12-08 16:28:35,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:28:35,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-08 16:28:35,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-08 16:28:35,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=4586, Unknown=0, NotChecked=0, Total=4830 [2018-12-08 16:28:35,962 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 50 states. [2018-12-08 16:28:38,480 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 72 [2018-12-08 16:28:39,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:39,652 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-08 16:28:39,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 16:28:39,653 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 43 [2018-12-08 16:28:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:39,654 INFO L225 Difference]: With dead ends: 80 [2018-12-08 16:28:39,654 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 16:28:39,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2351 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=673, Invalid=8069, Unknown=0, NotChecked=0, Total=8742 [2018-12-08 16:28:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 16:28:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-08 16:28:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 16:28:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-08 16:28:39,657 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 43 [2018-12-08 16:28:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:39,657 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-08 16:28:39,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-08 16:28:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-08 16:28:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 16:28:39,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:39,658 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:39,658 INFO L423 AbstractCegarLoop]: === Iteration 23 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:28:39,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash 884061475, now seen corresponding path program 1 times [2018-12-08 16:28:39,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:28:39,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:28:39,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:39,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:28:39,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:28:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:40,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:28:40,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 16:28:40,018 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-08 16:28:40,019 INFO L205 CegarAbsIntRunner]: [0], [1], [7], [8], [11], [12], [15], [46], [49], [51], [53], [66], [68], [70], [72], [73], [104], [106], [111], [117], [119], [122], [125], [132], [134], [140], [142], [145], [148], [152], [155], [158], [159], [160], [161], [162], [164], [165], [166] [2018-12-08 16:28:40,019 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 16:28:40,019 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 16:28:40,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 16:28:40,047 INFO L272 AbstractInterpreter]: Visited 39 different actions 62 times. Merged at 10 different actions 20 times. Never widened. Performed 550 root evaluator evaluations with a maximum evaluation depth of 3. Performed 550 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-08 16:28:40,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:40,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 16:28:40,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:28:40,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:28:40,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:40,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 16:28:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:40,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:40,091 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-08 16:28:40,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 16:28:40,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,129 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 16 treesize of output 9 [2018-12-08 16:28:40,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2018-12-08 16:28:40,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:28:40,150 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 8 treesize of output 7 [2018-12-08 16:28:40,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-08 16:28:40,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-08 16:28:40,179 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 14 treesize of output 13 [2018-12-08 16:28:40,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,187 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-08 16:28:40,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-12-08 16:28:40,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-08 16:28:40,249 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 42 treesize of output 41 [2018-12-08 16:28:40,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:40,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-12-08 16:28:40,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-12-08 16:28:40,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,313 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 28 treesize of output 37 [2018-12-08 16:28:40,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:40,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:51 [2018-12-08 16:28:40,646 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 5 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 59 [2018-12-08 16:28:40,649 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 27 [2018-12-08 16:28:40,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,675 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 57 [2018-12-08 16:28:40,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-12-08 16:28:40,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:40,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:40,735 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:75, output treesize:73 [2018-12-08 16:28:40,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28: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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-12-08 16:28:40,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,877 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 23 treesize of output 28 [2018-12-08 16:28:40,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:40,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,900 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 2 case distinctions, treesize of input 15 treesize of output 18 [2018-12-08 16:28:40,900 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:40,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:40,906 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 2 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 16:28:40,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:40,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-08 16:28:40,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:76, output treesize:85 [2018-12-08 16:28:41,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:41,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:41,012 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 20 treesize of output 27 [2018-12-08 16:28:41,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:41,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:41,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:41,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-12-08 16:28:41,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:41,069 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 18 treesize of output 17 [2018-12-08 16:28:41,069 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:41,093 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-08 16:28:41,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:41,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-12-08 16:28:41,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:78, output treesize:88 [2018-12-08 16:28:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:41,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:28:41,426 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:41,430 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 28 treesize of output 40 [2018-12-08 16:28:41,445 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 8 [2018-12-08 16:28:41,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:41,453 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:41,454 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:41,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, 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 18 [2018-12-08 16:28:41,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:41,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:41,463 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 2 xjuncts. [2018-12-08 16:28:41,463 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-12-08 16:28:42,552 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 61 [2018-12-08 16:28:42,554 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 9 treesize of output 8 [2018-12-08 16:28:42,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,574 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2018-12-08 16:28:42,576 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 44 treesize of output 43 [2018-12-08 16:28:42,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,599 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 43 treesize of output 44 [2018-12-08 16:28:42,600 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,629 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2018-12-08 16:28:42,631 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 48 treesize of output 47 [2018-12-08 16:28:42,631 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 45 treesize of output 48 [2018-12-08 16:28:42,657 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,681 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 39 [2018-12-08 16:28:42,700 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 6 treesize of output 1 [2018-12-08 16:28:42,700 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2018-12-08 16:28:42,710 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,713 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2018-12-08 16:28:42,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 10 [2018-12-08 16:28:42,779 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,780 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:42,781 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,787 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 75 [2018-12-08 16:28:42,828 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 47 treesize of output 46 [2018-12-08 16:28:42,829 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:42,914 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:42,919 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 2 case distinctions, treesize of input 46 treesize of output 55 [2018-12-08 16:28:42,920 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:43,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:43,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 45 treesize of output 52 [2018-12-08 16:28:43,018 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-12-08 16:28:43,110 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2018-12-08 16:28:43,221 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:43,221 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 1 [2018-12-08 16:28:43,226 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,229 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,316 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2018-12-08 16:28:43,356 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 41 treesize of output 33 [2018-12-08 16:28:43,356 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 16:28:43,373 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,386 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:43,386 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:43,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-08 16:28:43,387 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2018-12-08 16:28:43,407 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:43,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2018-12-08 16:28:43,423 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,432 INFO L267 ElimStorePlain]: Start of recursive call 24: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:43,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 52 [2018-12-08 16:28:43,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 35 [2018-12-08 16:28:43,612 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:43,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2018-12-08 16:28:43,646 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:43,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-12-08 16:28:43,671 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,693 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 21 treesize of output 7 [2018-12-08 16:28:43,693 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,711 INFO L267 ElimStorePlain]: Start of recursive call 30: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:43,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:43,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 53 [2018-12-08 16:28:43,924 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:43,924 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:43,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 35 [2018-12-08 16:28:43,937 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:43,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 25 [2018-12-08 16:28:43,975 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:44,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2018-12-08 16:28:44,011 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:44,032 INFO L267 ElimStorePlain]: Start of recursive call 35: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:44,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 57 [2018-12-08 16:28:44,264 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 136 [2018-12-08 16:28:44,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2018-12-08 16:28:44,277 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:44,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2018-12-08 16:28:44,662 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:44,915 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 22 [2018-12-08 16:28:44,915 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:45,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 27 [2018-12-08 16:28:45,027 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:45,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 22 [2018-12-08 16:28:45,111 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:45,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-12-08 16:28:45,118 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:45,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 20 [2018-12-08 16:28:45,178 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:45,276 INFO L267 ElimStorePlain]: Start of recursive call 40: 10 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:45,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 42 [2018-12-08 16:28:45,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 9 [2018-12-08 16:28:45,370 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:45,371 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:28:45,371 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:45,381 INFO L267 ElimStorePlain]: Start of recursive call 48: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:45,398 INFO L267 ElimStorePlain]: Start of recursive call 16: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:45,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:45,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:28:45,444 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 86 treesize of output 63 [2018-12-08 16:28:45,445 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 9 treesize of output 8 [2018-12-08 16:28:45,445 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:45,464 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 60 [2018-12-08 16:28:45,466 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 46 treesize of output 45 [2018-12-08 16:28:45,466 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:45,487 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 45 treesize of output 46 [2018-12-08 16:28:45,487 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:45,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 78 [2018-12-08 16:28:45,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:45,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 47 treesize of output 54 [2018-12-08 16:28:45,535 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:45,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-12-08 16:28:45,651 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,058 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 72 [2018-12-08 16:28:46,097 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 4 xjuncts. [2018-12-08 16:28:46,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 55 [2018-12-08 16:28:46,422 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,423 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,423 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 27 treesize of output 18 [2018-12-08 16:28:46,423 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,466 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,467 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,467 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 15 [2018-12-08 16:28:46,467 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,469 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,470 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,470 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-08 16:28:46,470 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,511 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 32 treesize of output 30 [2018-12-08 16:28:46,511 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:46,546 INFO L267 ElimStorePlain]: Start of recursive call 60: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:46,669 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 51 treesize of output 45 [2018-12-08 16:28:46,690 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 4 [2018-12-08 16:28:46,690 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,691 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 15 treesize of output 1 [2018-12-08 16:28:46,692 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:28:46,698 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,702 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,703 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,704 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 53 treesize of output 48 [2018-12-08 16:28:46,727 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 4 [2018-12-08 16:28:46,727 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,729 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 15 treesize of output 1 [2018-12-08 16:28:46,729 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,734 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,735 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:28:46,735 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 15 treesize of output 9 [2018-12-08 16:28:46,735 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,740 INFO L267 ElimStorePlain]: Start of recursive call 69: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:46,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2018-12-08 16:28:46,872 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 29 treesize of output 27 [2018-12-08 16:28:46,873 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:46,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:46,910 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 32 [2018-12-08 16:28:46,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 29 [2018-12-08 16:28:46,923 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:46,929 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:46,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:46,942 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 40 [2018-12-08 16:28:46,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 19 [2018-12-08 16:28:46,951 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:46,959 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:46,978 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 16:28:47,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2018-12-08 16:28:47,092 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 1 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 16:28:47,092 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:47,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:47,124 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 40 [2018-12-08 16:28:47,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 19 [2018-12-08 16:28:47,133 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:47,139 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:47,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:47,155 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 32 [2018-12-08 16:28:47,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 29 [2018-12-08 16:28:47,169 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 2 xjuncts. [2018-12-08 16:28:47,174 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:28:47,193 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 16:28:47,249 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:47,287 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:47,299 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:28:47,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:28:47,335 INFO L202 ElimStorePlain]: Needed 84 recursive calls to eliminate 8 variables, input treesize:171, output treesize:92 [2018-12-08 16:28:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:47,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 16:28:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 65 [2018-12-08 16:28:47,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 16:28:47,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-08 16:28:47,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-08 16:28:47,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4031, Unknown=0, NotChecked=0, Total=4290 [2018-12-08 16:28:47,965 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 45 states. [2018-12-08 16:28:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:50,438 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-08 16:28:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 16:28:50,438 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-08 16:28:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:50,439 INFO L225 Difference]: With dead ends: 77 [2018-12-08 16:28:50,439 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 16:28:50,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=761, Invalid=7429, Unknown=0, NotChecked=0, Total=8190 [2018-12-08 16:28:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 16:28:50,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-12-08 16:28:50,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-08 16:28:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-12-08 16:28:50,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 44 [2018-12-08 16:28:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:50,441 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-12-08 16:28:50,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-08 16:28:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-08 16:28:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 16:28:50,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:50,441 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:50,441 INFO L423 AbstractCegarLoop]: === Iteration 24 === [_destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION]=== [2018-12-08 16:28:50,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 365775783, now seen corresponding path program 1 times [2018-12-08 16:28:50,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 16:28:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:28:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:50,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 16:28:50,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 16:28:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:28:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:28:50,471 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 16:28:50,481 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-08 16:28:50,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:28:50 BoogieIcfgContainer [2018-12-08 16:28:50,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 16:28:50,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:28:50,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:28:50,496 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:28:50,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:26:28" (3/4) ... [2018-12-08 16:28:50,499 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 16:28:50,499 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:28:50,499 INFO L168 Benchmark]: Toolchain (without parser) took 142800.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 945.9 MB in the beginning and 886.4 MB in the end (delta: 59.5 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. [2018-12-08 16:28:50,499 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:28:50,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-08 16:28:50,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.03 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:28:50,500 INFO L168 Benchmark]: Boogie Preprocessor took 18.94 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:28:50,500 INFO L168 Benchmark]: RCFGBuilder took 270.69 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: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-12-08 16:28:50,500 INFO L168 Benchmark]: TraceAbstraction took 142227.13 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 886.4 MB in the end (delta: 170.3 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. [2018-12-08 16:28:50,500 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.2 GB. Free memory was 886.4 MB in the beginning and 886.4 MB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. [2018-12-08 16:28:50,501 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -146.2 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.03 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.94 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 270.69 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: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 142227.13 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 886.4 MB in the end (delta: 170.3 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.2 GB. Free memory was 886.4 MB in the beginning and 886.4 MB in the end (delta: 2.2 kB). Peak memory consumption was 2.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; VAL [len=3] [L618] CALL, EXPR dll_circular_create(len) VAL [\old(len)=3] [L564] DLL last = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L568] last->next = last VAL [\old(len)=3, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L569] last->prev = last VAL [\old(len)=3, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L570] DLL head = last; VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={10:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L576] new_head->next = head VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={10:0}, last={10:0}, len=3, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={13:0}, malloc(sizeof(struct node))={10:0}, new_head={13:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L576] new_head->next = head VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={13:0}, last={10:0}, len=2, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L581] last->next = head VAL [\old(len)=3, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L582] head->prev = last VAL [\old(len)=3, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L583] return head; VAL [\old(len)=3, \result={11:0}, head={11:0}, last={10:0}, len=1, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={10:0}, new_head={11:0}] [L618] RET, EXPR dll_circular_create(len) VAL [dll_circular_create(len)={11:0}, len=3] [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) VAL [head={11:0}] [L586] EXPR head->prev VAL [head={11:0}, head={11:0}, head->prev={10:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={11:0}, head={11:0}, head->next={13:0}, pred={10:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={11:0}, head={11:0}, pred={10:0}, succ={13:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={11:0}, head={11:0}, pred={10:0}, succ={13:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) VAL [head={11:0}, len=3] [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 120 locations, 45 error locations. UNSAFE Result, 142.1s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 69.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1719 SDtfs, 2383 SDslu, 9341 SDs, 0 SdLazy, 10344 SolverSat, 732 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1278 GetRequests, 538 SyntacticMatches, 58 SemanticMatches, 682 ConstructedPredicates, 0 IntricatePredicates, 12 DeprecatedPredicates, 10248 ImplicationChecksByTransitivity, 98.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 11 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 33 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 71.5s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1451 ConstructedInterpolants, 250 QuantifiedInterpolants, 753015 SizeOfPredicates, 212 NumberOfNonLiveVariables, 2115 ConjunctsInSsa, 449 ConjunctsInUnsatCore, 45 InterpolantComputations, 13 PerfectInterpolantSequences, 51/233 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 16:28:51,779 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 16:28:51,780 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 16:28:51,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 16:28:51,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 16:28:51,790 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 16:28:51,791 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 16:28:51,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 16:28:51,793 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 16:28:51,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 16:28:51,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 16:28:51,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 16:28:51,795 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 16:28:51,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 16:28:51,796 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 16:28:51,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 16:28:51,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 16:28:51,798 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 16:28:51,799 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 16:28:51,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 16:28:51,800 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 16:28:51,801 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 16:28:51,802 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 16:28:51,802 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 16:28:51,802 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 16:28:51,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 16:28:51,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 16:28:51,803 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 16:28:51,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 16:28:51,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 16:28:51,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 16:28:51,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 16:28:51,804 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 16:28:51,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 16:28:51,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 16:28:51,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 16:28:51,805 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-08 16:28:51,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 16:28:51,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 16:28:51,813 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 16:28:51,814 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 16:28:51,814 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 16:28:51,814 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 16:28:51,814 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 16:28:51,814 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 16:28:51,814 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 16:28:51,814 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 16:28:51,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 16:28:51,814 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 16:28:51,815 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 16:28:51,815 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 16:28:51,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 16:28:51,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 16:28:51,816 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 16:28:51,816 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_b04775cb-73dd-473f-aa11-c7900932968b/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 -> 760c75961baa7cc196b373809e9a87dd0bcf8eb7 [2018-12-08 16:28:51,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 16:28:51,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 16:28:51,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 16:28:51,849 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 16:28:51,849 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 16:28:51,850 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i [2018-12-08 16:28:51,886 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data/60909df87/9a48e91ad8444574904d500265d415e4/FLAGb025685f7 [2018-12-08 16:28:52,228 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 16:28:52,228 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order_false-valid-memtrack.i [2018-12-08 16:28:52,234 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data/60909df87/9a48e91ad8444574904d500265d415e4/FLAGb025685f7 [2018-12-08 16:28:52,647 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/data/60909df87/9a48e91ad8444574904d500265d415e4 [2018-12-08 16:28:52,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 16:28:52,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 16:28:52,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 16:28:52,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 16:28:52,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 16:28:52,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de49706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52, skipping insertion in model container [2018-12-08 16:28:52,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 16:28:52,684 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 16:28:52,839 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:28:52,847 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 16:28:52,874 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 16:28:52,932 INFO L195 MainTranslator]: Completed translation [2018-12-08 16:28:52,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52 WrapperNode [2018-12-08 16:28:52,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 16:28:52,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 16:28:52,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 16:28:52,933 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 16:28:52,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 16:28:52,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 16:28:52,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 16:28:52,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 16:28:52,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... [2018-12-08 16:28:52,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 16:28:52,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 16:28:52,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 16:28:52,977 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 16:28:52,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure _destroy_in_nondeterministic_order [2018-12-08 16:28:53,009 INFO L138 BoogieDeclarations]: Found implementation of procedure _destroy_in_nondeterministic_order [2018-12-08 16:28:53,009 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-12-08 16:28:53,009 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-12-08 16:28:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 16:28:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 16:28:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 16:28:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 16:28:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 16:28:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 16:28:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 16:28:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 16:28:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 16:28:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 16:28:53,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 16:28:53,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 16:28:53,284 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 16:28:53,285 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-08 16:28:53,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:53 BoogieIcfgContainer [2018-12-08 16:28:53,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 16:28:53,286 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 16:28:53,286 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 16:28:53,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 16:28:53,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:28:52" (1/3) ... [2018-12-08 16:28:53,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f70c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:28:53, skipping insertion in model container [2018-12-08 16:28:53,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:28:52" (2/3) ... [2018-12-08 16:28:53,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f70c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:28:53, skipping insertion in model container [2018-12-08 16:28:53,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:53" (3/3) ... [2018-12-08 16:28:53,289 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order_false-valid-memtrack.i [2018-12-08 16:28:53,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 16:28:53,300 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-12-08 16:28:53,309 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-12-08 16:28:53,323 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 16:28:53,324 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 16:28:53,324 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-08 16:28:53,324 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 16:28:53,324 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 16:28:53,324 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 16:28:53,324 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 16:28:53,324 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 16:28:53,324 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 16:28:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-12-08 16:28:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 16:28:53,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:53,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:53,343 INFO L423 AbstractCegarLoop]: === Iteration 1 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:53,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash 166638613, now seen corresponding path program 1 times [2018-12-08 16:28:53,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:53,349 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:53,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:53,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:53,427 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-08 16:28:53,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:53,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:53,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 16:28:53,440 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-08 16:28:53,440 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:53,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:53,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:28:53,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:28:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:28:53,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:28:53,454 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2018-12-08 16:28:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:53,557 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2018-12-08 16:28:53,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:28:53,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 16:28:53,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:53,563 INFO L225 Difference]: With dead ends: 115 [2018-12-08 16:28:53,564 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 16:28:53,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:28:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 16:28:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-08 16:28:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-08 16:28:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2018-12-08 16:28:53,589 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 10 [2018-12-08 16:28:53,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:53,589 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2018-12-08 16:28:53,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:28:53,589 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2018-12-08 16:28:53,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 16:28:53,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:53,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:53,590 INFO L423 AbstractCegarLoop]: === Iteration 2 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:53,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:53,591 INFO L82 PathProgramCache]: Analyzing trace with hash 166638614, now seen corresponding path program 1 times [2018-12-08 16:28:53,591 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:53,591 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:53,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:53,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:53,640 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-08 16:28:53,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:53,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:53,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 16:28:53,664 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-08 16:28:53,665 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:53,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:53,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:28:53,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:28:53,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:28:53,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:28:53,668 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand 3 states. [2018-12-08 16:28:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:53,731 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-08 16:28:53,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:28:53,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-08 16:28:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:53,733 INFO L225 Difference]: With dead ends: 105 [2018-12-08 16:28:53,733 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 16:28:53,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:28:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 16:28:53,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-08 16:28:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 16:28:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-08 16:28:53,738 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 10 [2018-12-08 16:28:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:53,739 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-08 16:28:53,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:28:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-08 16:28:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 16:28:53,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:53,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:53,740 INFO L423 AbstractCegarLoop]: === Iteration 3 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:53,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:53,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1278525649, now seen corresponding path program 1 times [2018-12-08 16:28:53,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:53,741 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:53,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:53,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:53,795 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-08 16:28:53,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:53,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:53,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 16:28:53,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:28:53,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:28:53,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:28:53,797 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 5 states. [2018-12-08 16:28:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:53,825 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-12-08 16:28:53,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:28:53,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-08 16:28:53,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:53,827 INFO L225 Difference]: With dead ends: 114 [2018-12-08 16:28:53,827 INFO L226 Difference]: Without dead ends: 114 [2018-12-08 16:28:53,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-08 16:28:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-08 16:28:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2018-12-08 16:28:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-08 16:28:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-12-08 16:28:53,833 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 15 [2018-12-08 16:28:53,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:53,834 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-12-08 16:28:53,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:28:53,834 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-12-08 16:28:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 16:28:53,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:53,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:53,835 INFO L423 AbstractCegarLoop]: === Iteration 4 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:53,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1278527187, now seen corresponding path program 1 times [2018-12-08 16:28:53,836 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:53,836 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:53,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:53,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:53,897 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-08 16:28:53,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:53,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:53,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 16:28:53,912 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-08 16:28:53,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:53,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:53,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 16:28:53,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 16:28:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 16:28:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:28:53,915 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 3 states. [2018-12-08 16:28:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:53,970 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-08 16:28:53,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 16:28:53,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 16:28:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:53,972 INFO L225 Difference]: With dead ends: 105 [2018-12-08 16:28:53,972 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 16:28:53,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 16:28:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 16:28:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-08 16:28:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 16:28:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-08 16:28:53,978 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 15 [2018-12-08 16:28:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:53,978 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-08 16:28:53,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 16:28:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-08 16:28:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 16:28:53,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:53,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:53,979 INFO L423 AbstractCegarLoop]: === Iteration 5 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:53,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1278527186, now seen corresponding path program 1 times [2018-12-08 16:28:53,980 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:53,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:53,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:54,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:54,042 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-08 16:28:54,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,048 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-08 16:28:54,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-08 16:28:54,057 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-08 16:28:54,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:54,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:54,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:28:54,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:28:54,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:28:54,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:28:54,059 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 4 states. [2018-12-08 16:28:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:54,146 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2018-12-08 16:28:54,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:28:54,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-08 16:28:54,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:54,147 INFO L225 Difference]: With dead ends: 104 [2018-12-08 16:28:54,147 INFO L226 Difference]: Without dead ends: 104 [2018-12-08 16:28:54,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:28:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-08 16:28:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-08 16:28:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-08 16:28:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2018-12-08 16:28:54,150 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 15 [2018-12-08 16:28:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:54,151 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2018-12-08 16:28:54,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:28:54,151 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2018-12-08 16:28:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 16:28:54,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:54,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:54,152 INFO L423 AbstractCegarLoop]: === Iteration 6 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:54,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:54,152 INFO L82 PathProgramCache]: Analyzing trace with hash 979637217, now seen corresponding path program 1 times [2018-12-08 16:28:54,152 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:54,152 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:54,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:54,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:54,209 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-08 16:28:54,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 16:28:54,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-08 16:28:54,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,228 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-08 16:28:54,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-08 16:28:54,233 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-08 16:28:54,234 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:54,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:54,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 16:28:54,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 16:28:54,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 16:28:54,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 16:28:54,235 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 4 states. [2018-12-08 16:28:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:54,362 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-08 16:28:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 16:28:54,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-08 16:28:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:54,363 INFO L225 Difference]: With dead ends: 108 [2018-12-08 16:28:54,363 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 16:28:54,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:28:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 16:28:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-08 16:28:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-08 16:28:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-12-08 16:28:54,366 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 16 [2018-12-08 16:28:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:54,367 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-12-08 16:28:54,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 16:28:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-12-08 16:28:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-08 16:28:54,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:54,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:54,367 INFO L423 AbstractCegarLoop]: === Iteration 7 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:54,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:54,368 INFO L82 PathProgramCache]: Analyzing trace with hash 979637218, now seen corresponding path program 1 times [2018-12-08 16:28:54,368 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:54,368 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:54,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:54,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:54,443 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-08 16:28:54,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,451 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-08 16:28:54,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 16:28:54,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:54,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-08 16:28:54,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:54,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:54,496 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-08 16:28:54,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:54,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-08 16:28:54,521 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-08 16:28:54,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:54,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:54,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 16:28:54,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 16:28:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 16:28:54,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 16:28:54,523 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 5 states. [2018-12-08 16:28:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:54,724 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2018-12-08 16:28:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 16:28:54,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-08 16:28:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:54,725 INFO L225 Difference]: With dead ends: 108 [2018-12-08 16:28:54,725 INFO L226 Difference]: Without dead ends: 108 [2018-12-08 16:28:54,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-08 16:28:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-08 16:28:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-12-08 16:28:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-08 16:28:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-08 16:28:54,730 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 16 [2018-12-08 16:28:54,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:54,730 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-08 16:28:54,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 16:28:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-08 16:28:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 16:28:54,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:54,731 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-08 16:28:54,732 INFO L423 AbstractCegarLoop]: === Iteration 8 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:54,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2135134892, now seen corresponding path program 1 times [2018-12-08 16:28:54,732 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:54,732 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:54,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:54,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:54,801 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-08 16:28:54,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:28:54,852 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-08 16:28:54,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:28:54,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:28:54,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:54,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:54,880 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-08 16:28:54,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:54,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 16:28:54,905 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-08 16:28:54,905 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:54,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 16:28:54,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 6] total 12 [2018-12-08 16:28:54,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 16:28:54,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 16:28:54,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:28:54,931 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 12 states. [2018-12-08 16:28:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:55,219 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2018-12-08 16:28:55,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 16:28:55,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-12-08 16:28:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:55,220 INFO L225 Difference]: With dead ends: 112 [2018-12-08 16:28:55,220 INFO L226 Difference]: Without dead ends: 112 [2018-12-08 16:28:55,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-12-08 16:28:55,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-08 16:28:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2018-12-08 16:28:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-08 16:28:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2018-12-08 16:28:55,223 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 20 [2018-12-08 16:28:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:55,224 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2018-12-08 16:28:55,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 16:28:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2018-12-08 16:28:55,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 16:28:55,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:55,224 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:55,231 INFO L423 AbstractCegarLoop]: === Iteration 9 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:55,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1764624449, now seen corresponding path program 1 times [2018-12-08 16:28:55,231 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:55,232 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:55,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:55,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:55,322 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-08 16:28:55,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,327 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-08 16:28:55,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 16:28:55,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:55,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:55,353 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-08 16:28:55,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-08 16:28:55,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:55,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-08 16:28:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:55,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:28:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:55,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:28:55,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:28:55,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:55,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:55,631 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-08 16:28:55,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-08 16:28:55,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-08 16:28:55,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:55,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-08 16:28:55,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:55,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:55,663 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-08 16:28:55,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:55,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:55,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:20 [2018-12-08 16:28:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:55,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:28:55,869 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2018-12-08 16:28:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:55,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:28:55,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 5] total 8 [2018-12-08 16:28:55,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:28:55,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:28:55,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:28:55,903 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand 9 states. [2018-12-08 16:28:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:56,579 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-08 16:28:56,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 16:28:56,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-08 16:28:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:56,581 INFO L225 Difference]: With dead ends: 105 [2018-12-08 16:28:56,581 INFO L226 Difference]: Without dead ends: 105 [2018-12-08 16:28:56,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:28:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-08 16:28:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-08 16:28:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-08 16:28:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-12-08 16:28:56,585 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 21 [2018-12-08 16:28:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:56,585 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-12-08 16:28:56,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:28:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-12-08 16:28:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 16:28:56,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:56,586 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:56,587 INFO L423 AbstractCegarLoop]: === Iteration 10 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:56,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2013618610, now seen corresponding path program 1 times [2018-12-08 16:28:56,587 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:56,587 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:56,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:56,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:56,689 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-08 16:28:56,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:56,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:56,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 16:28:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:28:56,735 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:56,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:56,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:28:56,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:28:56,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:28:56,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:28:56,738 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 9 states. [2018-12-08 16:28:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:57,226 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-12-08 16:28:57,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:28:57,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-08 16:28:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:57,227 INFO L225 Difference]: With dead ends: 102 [2018-12-08 16:28:57,228 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 16:28:57,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:28:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 16:28:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-08 16:28:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-08 16:28:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-12-08 16:28:57,231 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 32 [2018-12-08 16:28:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:57,231 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-12-08 16:28:57,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:28:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-12-08 16:28:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 16:28:57,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:57,232 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:57,233 INFO L423 AbstractCegarLoop]: === Iteration 11 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:57,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2013618611, now seen corresponding path program 1 times [2018-12-08 16:28:57,233 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:57,233 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:57,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:57,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:57,351 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-08 16:28:57,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:57,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:57,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 16:28:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:28:57,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:28:57,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:28:57,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 16:28:57,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 16:28:57,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 16:28:57,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-08 16:28:57,430 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 9 states. [2018-12-08 16:28:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:28:57,775 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-08 16:28:57,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 16:28:57,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-12-08 16:28:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:28:57,776 INFO L225 Difference]: With dead ends: 95 [2018-12-08 16:28:57,776 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 16:28:57,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 16:28:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 16:28:57,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-08 16:28:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 16:28:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-12-08 16:28:57,778 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 32 [2018-12-08 16:28:57,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:28:57,778 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-12-08 16:28:57,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 16:28:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-12-08 16:28:57,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 16:28:57,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:28:57,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:28:57,779 INFO L423 AbstractCegarLoop]: === Iteration 12 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:28:57,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:28:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2091022798, now seen corresponding path program 1 times [2018-12-08 16:28:57,780 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:28:57,780 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:28:57,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:28:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:28:57,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:28:57,956 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-08 16:28:57,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:57,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:57,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-08 16:28:58,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:58,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:58,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:58,011 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 18 treesize of output 9 [2018-12-08 16:28:58,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:15 [2018-12-08 16:28:58,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:28:58,055 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-08 16:28:58,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-12-08 16:28:58,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 16:28:58,120 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-08 16:28:58,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,145 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-08 16:28:58,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-12-08 16:28:58,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-12-08 16:28:58,232 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 35 treesize of output 34 [2018-12-08 16:28:58,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:58,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-12-08 16:28:58,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2018-12-08 16:28:58,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:28:58,350 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-08 16:28:58,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:58,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:39 [2018-12-08 16:28:58,809 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2018-12-08 16:28:58,813 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 23 [2018-12-08 16:28:58,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-12-08 16:28:58,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:28:58,859 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 14 treesize of output 3 [2018-12-08 16:28:58,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:28:58,872 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2018-12-08 16:28:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:28:58,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:28:59,472 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-08 16:28:59,636 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-08 16:29:00,007 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 16:29:00,258 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 16:29:00,697 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 67 treesize of output 45 [2018-12-08 16:29:00,703 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 9 treesize of output 8 [2018-12-08 16:29:00,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:00,771 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2018-12-08 16:29:00,919 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 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 16:29:00,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:01,155 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 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 16:29:01,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:01,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2018-12-08 16:29:01,206 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:01,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 16:29:01,273 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:01,846 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 33 treesize of output 32 [2018-12-08 16:29:01,847 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:01,850 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 34 treesize of output 33 [2018-12-08 16:29:01,850 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:01,853 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 33 treesize of output 32 [2018-12-08 16:29:01,854 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,254 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 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-08 16:29:02,257 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 18 treesize of output 10 [2018-12-08 16:29:02,257 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,307 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:02,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-08 16:29:02,311 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,328 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:29:02,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-08 16:29:02,345 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 18 treesize of output 10 [2018-12-08 16:29:02,345 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,413 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:02,415 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 23 treesize of output 12 [2018-12-08 16:29:02,416 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,436 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:29:02,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 35 [2018-12-08 16:29:02,458 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 15 [2018-12-08 16:29:02,458 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,530 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:02,533 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 17 [2018-12-08 16:29:02,533 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,555 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:29:02,891 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 28 treesize of output 24 [2018-12-08 16:29:02,894 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 14 treesize of output 10 [2018-12-08 16:29:02,895 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,902 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:02,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:29:03,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:29:03,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:29:03,054 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 2 variables, input treesize:67, output treesize:61 [2018-12-08 16:29:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:03,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:29:03,504 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:29:03,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:03,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:03,595 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-08 16:29:03,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 16:29:03,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:03,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:03,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:03,607 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 18 treesize of output 9 [2018-12-08 16:29:03,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2018-12-08 16:29:03,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:29:03,672 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-08 16:29:03,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-08 16:29:03,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-08 16:29:03,754 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-08 16:29:03,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:03,771 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-08 16:29:03,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-12-08 16:29:03,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2018-12-08 16:29:03,972 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 32 treesize of output 33 [2018-12-08 16:29:03,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:04,022 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 23 treesize of output 22 [2018-12-08 16:29:04,023 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:04,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:04,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:04,054 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-12-08 16:29:04,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 38 [2018-12-08 16:29:04,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:04,193 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 27 [2018-12-08 16:29:04,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:04,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:04,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:04,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:46 [2018-12-08 16:29:04,905 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2018-12-08 16:29:04,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:04,914 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-12-08 16:29:04,915 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-08 16:29:04,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-08 16:29:04,956 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:05,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:05,014 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2018-12-08 16:29:05,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:05,030 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 0 case distinctions, treesize of input 11 treesize of output 7 [2018-12-08 16:29:05,030 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:05,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:05,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:05,040 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:3 [2018-12-08 16:29:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:05,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:05,342 WARN L180 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-08 16:29:05,546 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-12-08 16:29:05,711 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 16:29:05,953 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 16:29:06,007 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 67 treesize of output 45 [2018-12-08 16:29:06,013 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 9 treesize of output 8 [2018-12-08 16:29:06,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:06,085 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 52 [2018-12-08 16:29:06,188 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-08 16:29:06,192 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 34 treesize of output 33 [2018-12-08 16:29:06,192 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:06,195 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 33 treesize of output 32 [2018-12-08 16:29:06,195 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:06,198 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 33 treesize of output 32 [2018-12-08 16:29:06,198 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:06,201 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 33 treesize of output 32 [2018-12-08 16:29:06,201 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:06,488 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 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 16:29:06,488 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:06,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 40 [2018-12-08 16:29:06,575 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:06,629 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 2 case distinctions, treesize of input 33 treesize of output 41 [2018-12-08 16:29:06,629 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:07,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-08 16:29:07,095 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 6 treesize of output 1 [2018-12-08 16:29:07,096 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:29:07,112 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,121 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,125 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-08 16:29:07,128 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 12 treesize of output 3 [2018-12-08 16:29:07,128 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:29:07,141 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,146 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-12-08 16:29:07,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:29:07,156 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,167 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 3 [2018-12-08 16:29:07,167 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,173 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,381 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 28 treesize of output 24 [2018-12-08 16:29:07,384 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 14 treesize of output 10 [2018-12-08 16:29:07,384 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,395 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,398 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 26 [2018-12-08 16:29:07,444 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:07,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-08 16:29:07,447 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,457 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,459 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-12-08 16:29:07,551 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:07,554 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 20 treesize of output 9 [2018-12-08 16:29:07,554 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,564 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,567 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 33 treesize of output 27 [2018-12-08 16:29:07,600 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:07,602 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 20 treesize of output 9 [2018-12-08 16:29:07,602 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,611 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:07,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:29:07,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:29:07,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-12-08 16:29:07,854 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 3 variables, input treesize:67, output treesize:42 [2018-12-08 16:29:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:08,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:29:08,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17, 16] total 45 [2018-12-08 16:29:08,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-08 16:29:08,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-08 16:29:08,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1906, Unknown=0, NotChecked=0, Total=2070 [2018-12-08 16:29:08,197 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 46 states. [2018-12-08 16:29:09,716 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2018-12-08 16:29:10,172 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2018-12-08 16:29:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:29:11,575 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-08 16:29:11,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 16:29:11,576 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 38 [2018-12-08 16:29:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:29:11,577 INFO L225 Difference]: With dead ends: 95 [2018-12-08 16:29:11,577 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 16:29:11,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=439, Invalid=3343, Unknown=0, NotChecked=0, Total=3782 [2018-12-08 16:29:11,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 16:29:11,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-12-08 16:29:11,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 16:29:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-12-08 16:29:11,580 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 38 [2018-12-08 16:29:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:29:11,581 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-12-08 16:29:11,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-08 16:29:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-12-08 16:29:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-08 16:29:11,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:29:11,581 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:29:11,582 INFO L423 AbstractCegarLoop]: === Iteration 13 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:29:11,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:29:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2091021902, now seen corresponding path program 1 times [2018-12-08 16:29:11,582 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:29:11,583 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:29:11,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:11,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:11,693 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-08 16:29:11,694 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-08 16:29:11,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:11,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:11,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:11,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-12-08 16:29:11,782 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-08 16:29:11,783 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-08 16:29:11,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:11,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:11,785 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-08 16:29:11,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-08 16:29:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:29:11,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:29:11,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:29:11,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 16:29:11,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 16:29:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 16:29:11,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-08 16:29:11,818 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 13 states. [2018-12-08 16:29:12,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:29:12,371 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-08 16:29:12,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 16:29:12,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-12-08 16:29:12,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:29:12,372 INFO L225 Difference]: With dead ends: 86 [2018-12-08 16:29:12,372 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 16:29:12,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-12-08 16:29:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 16:29:12,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-08 16:29:12,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-08 16:29:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-12-08 16:29:12,373 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 38 [2018-12-08 16:29:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:29:12,374 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-12-08 16:29:12,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 16:29:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-12-08 16:29:12,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 16:29:12,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:29:12,374 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:29:12,375 INFO L423 AbstractCegarLoop]: === Iteration 14 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:29:12,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:29:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash -397197215, now seen corresponding path program 1 times [2018-12-08 16:29:12,375 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:29:12,375 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:29:12,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:12,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:12,513 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-08 16:29:12,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 16:29:12,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:12,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:12,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:12,551 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 18 treesize of output 9 [2018-12-08 16:29:12,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2018-12-08 16:29:12,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:29:12,574 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 8 treesize of output 7 [2018-12-08 16:29:12,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-08 16:29:12,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-12-08 16:29:12,611 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 14 treesize of output 13 [2018-12-08 16:29:12,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,645 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-08 16:29:12,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-12-08 16:29:12,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 16:29:12,765 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 51 treesize of output 50 [2018-12-08 16:29:12,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:12,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-08 16:29:12,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-08 16:29:12,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:12,925 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 35 treesize of output 46 [2018-12-08 16:29:12,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:12,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:12,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:57 [2018-12-08 16:29:13,355 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2018-12-08 16:29:13,360 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2018-12-08 16:29:13,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:13,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-12-08 16:29:13,397 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:13,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-12-08 16:29:13,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:13,462 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 24 treesize of output 12 [2018-12-08 16:29:13,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:13,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:13,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:13,477 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:59, output treesize:7 [2018-12-08 16:29:13,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:13,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:14,259 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-12-08 16:29:14,609 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-08 16:29:14,884 WARN L180 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:29:15,179 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:29:15,519 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 46 treesize of output 41 [2018-12-08 16:29:15,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:15,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:15,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2018-12-08 16:29:15,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2018-12-08 16:29:15,669 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 9 treesize of output 8 [2018-12-08 16:29:15,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:15,690 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:15,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-08 16:29:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-08 16:29:15,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:15,781 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 19 treesize of output 18 [2018-12-08 16:29:15,785 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 6 treesize of output 1 [2018-12-08 16:29:15,785 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:15,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:29:15,795 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:15,797 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:15,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:15,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:15,818 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-08 16:29:15,818 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:67, output treesize:8 [2018-12-08 16:29:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:29:16,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:29:16,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:29:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:16,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:16,121 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-08 16:29:16,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 16:29:16,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:16,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:16,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:16,130 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 18 treesize of output 9 [2018-12-08 16:29:16,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-12-08 16:29:16,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:29:16,196 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 8 treesize of output 7 [2018-12-08 16:29:16,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-08 16:29:16,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-08 16:29:16,299 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 14 treesize of output 13 [2018-12-08 16:29:16,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:16,322 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-08 16:29:16,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-12-08 16:29:18,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 16:29:18,581 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 51 treesize of output 50 [2018-12-08 16:29:18,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:18,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:18,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:18,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2018-12-08 16:29:18,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-08 16:29:18,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:18,800 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 35 treesize of output 46 [2018-12-08 16:29:18,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:18,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:18,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:18,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:54 [2018-12-08 16:29:19,662 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2018-12-08 16:29:19,669 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-12-08 16:29:19,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:19,719 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-08 16:29:19,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:19,767 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 27 [2018-12-08 16:29:19,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:19,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 15 treesize of output 10 [2018-12-08 16:29:19,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:19,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:19,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:19,817 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:61, output treesize:5 [2018-12-08 16:29:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:19,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:20,127 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-12-08 16:29:20,380 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-08 16:29:20,733 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 16:29:21,073 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 16:29:21,128 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 46 treesize of output 41 [2018-12-08 16:29:21,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:21,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:35 [2018-12-08 16:29:21,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 45 [2018-12-08 16:29:21,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-08 16:29:21,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,176 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:21,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-08 16:29:21,243 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 11 treesize of output 10 [2018-12-08 16:29:21,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,266 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 19 treesize of output 18 [2018-12-08 16:29:21,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:29:21,269 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,275 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 6 treesize of output 1 [2018-12-08 16:29:21,275 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:21,297 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:67, output treesize:8 [2018-12-08 16:29:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:21,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:29:21,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 17, 16] total 43 [2018-12-08 16:29:21,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-08 16:29:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-08 16:29:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1730, Unknown=1, NotChecked=0, Total=1892 [2018-12-08 16:29:21,321 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 44 states. [2018-12-08 16:29:22,948 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-12-08 16:29:23,914 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-08 16:29:24,521 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-12-08 16:29:24,750 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-08 16:29:27,273 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:29:28,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:29:28,556 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-12-08 16:29:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 16:29:28,557 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 39 [2018-12-08 16:29:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:29:28,557 INFO L225 Difference]: With dead ends: 89 [2018-12-08 16:29:28,557 INFO L226 Difference]: Without dead ends: 89 [2018-12-08 16:29:28,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=473, Invalid=3186, Unknown=1, NotChecked=0, Total=3660 [2018-12-08 16:29:28,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-08 16:29:28,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-12-08 16:29:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-08 16:29:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2018-12-08 16:29:28,559 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 39 [2018-12-08 16:29:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:29:28,559 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2018-12-08 16:29:28,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-08 16:29:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2018-12-08 16:29:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 16:29:28,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:29:28,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:29:28,560 INFO L423 AbstractCegarLoop]: === Iteration 15 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:29:28,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:29:28,560 INFO L82 PathProgramCache]: Analyzing trace with hash -397169411, now seen corresponding path program 1 times [2018-12-08 16:29:28,560 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:29:28,561 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:29:28,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:28,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:28,666 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-08 16:29:28,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:28,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:28,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-08 16:29:28,680 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-08 16:29:28,681 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-08 16:29:28,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:28,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:28,690 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-08 16:29:28,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:17 [2018-12-08 16:29:28,763 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-08 16:29:28,764 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-08 16:29:28,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:28,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:28,766 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-08 16:29:28,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-12-08 16:29:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 16:29:28,793 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 16:29:28,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 16:29:28,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 16:29:28,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 16:29:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 16:29:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-12-08 16:29:28,795 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand 13 states. [2018-12-08 16:29:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:29:29,366 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-12-08 16:29:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 16:29:29,367 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-12-08 16:29:29,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:29:29,367 INFO L225 Difference]: With dead ends: 84 [2018-12-08 16:29:29,367 INFO L226 Difference]: Without dead ends: 84 [2018-12-08 16:29:29,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-12-08 16:29:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-08 16:29:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-08 16:29:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-08 16:29:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-12-08 16:29:29,369 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-12-08 16:29:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:29:29,369 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-12-08 16:29:29,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 16:29:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-12-08 16:29:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 16:29:29,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:29:29,370 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:29:29,370 INFO L423 AbstractCegarLoop]: === Iteration 16 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:29:29,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:29:29,370 INFO L82 PathProgramCache]: Analyzing trace with hash -283711699, now seen corresponding path program 1 times [2018-12-08 16:29:29,370 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:29:29,370 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:29:29,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:29,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:29,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 16:29:29,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-08 16:29:29,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:29,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:29,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 16:29:29,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 16:29:29,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 16:29:29,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 16:29:29,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,545 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-08 16:29:29,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-12-08 16:29:29,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-08 16:29:29,673 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-08 16:29:29,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:10 [2018-12-08 16:29:29,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:29,726 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-08 16:29:29,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:29,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:29,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-08 16:29:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:29,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:30,377 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:29:30,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,381 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 6 treesize of output 1 [2018-12-08 16:29:30,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:4 [2018-12-08 16:29:30,481 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 12 treesize of output 7 [2018-12-08 16:29:30,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-08 16:29:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:30,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:29:30,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:29:30,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:30,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:30,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:30,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:30,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 16:29:30,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 16:29:30,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 16:29:30,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 16:29:30,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,570 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-08 16:29:30,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:27 [2018-12-08 16:29:30,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-12-08 16:29:30,576 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:30,577 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 21 treesize of output 15 [2018-12-08 16:29:30,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:13 [2018-12-08 16:29:30,695 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:30,695 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-08 16:29:30,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:30,701 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-08 16:29:30,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-08 16:29:30,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:30,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:31,526 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:29:31,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:31,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-12-08 16:29:31,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:31,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:31,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:15 [2018-12-08 16:29:31,713 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 12 treesize of output 7 [2018-12-08 16:29:31,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:31,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:31,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-08 16:29:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:31,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:29:31,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16, 16] total 38 [2018-12-08 16:29:31,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-08 16:29:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-08 16:29:31,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2018-12-08 16:29:31,734 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 39 states. [2018-12-08 16:29:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:29:33,936 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-12-08 16:29:33,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 16:29:33,936 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 41 [2018-12-08 16:29:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:29:33,937 INFO L225 Difference]: With dead ends: 83 [2018-12-08 16:29:33,937 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 16:29:33,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-12-08 16:29:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 16:29:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-08 16:29:33,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-08 16:29:33,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-12-08 16:29:33,940 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 41 [2018-12-08 16:29:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:29:33,940 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-12-08 16:29:33,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-08 16:29:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-12-08 16:29:33,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 16:29:33,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:29:33,940 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:29:33,941 INFO L423 AbstractCegarLoop]: === Iteration 17 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:29:33,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:29:33,941 INFO L82 PathProgramCache]: Analyzing trace with hash -283721629, now seen corresponding path program 1 times [2018-12-08 16:29:33,941 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:29:33,941 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:29:33,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:34,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:34,113 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-08 16:29:34,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 16:29:34,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:34,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:34,151 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:34,151 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 18 treesize of output 9 [2018-12-08 16:29:34,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2018-12-08 16:29:34,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-08 16:29:34,174 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 8 treesize of output 7 [2018-12-08 16:29:34,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-12-08 16:29:34,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-12-08 16:29:34,214 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 14 treesize of output 13 [2018-12-08 16:29:34,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,239 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-08 16:29:34,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-12-08 16:29:34,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 16:29:34,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-12-08 16:29:34,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,435 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 39 treesize of output 38 [2018-12-08 16:29:34,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:34,493 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-12-08 16:29:34,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-08 16:29:34,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:34,589 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 35 treesize of output 46 [2018-12-08 16:29:34,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:34,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:34,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:57 [2018-12-08 16:29:36,951 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-08 16:29:37,058 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2018-12-08 16:29:37,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 45 treesize of output 40 [2018-12-08 16:29:37,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:37,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-12-08 16:29:37,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:37,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-12-08 16:29:37,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:37,177 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 12 [2018-12-08 16:29:37,177 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:37,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:37,196 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-08 16:29:37,196 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:59, output treesize:12 [2018-12-08 16:29:37,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:37,286 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-08 16:29:37,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:37,291 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-08 16:29:37,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-08 16:29:37,344 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:37,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:38,086 WARN L180 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-12-08 16:29:38,474 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-08 16:29:38,880 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:29:39,261 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:29:39,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2018-12-08 16:29:39,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:39,882 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 43 treesize of output 36 [2018-12-08 16:29:39,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:39,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 16:29:39,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:88, output treesize:72 [2018-12-08 16:29:40,197 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 68 treesize of output 46 [2018-12-08 16:29:40,202 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 9 treesize of output 8 [2018-12-08 16:29:40,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,279 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2018-12-08 16:29:40,415 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-08 16:29:40,419 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 31 treesize of output 30 [2018-12-08 16:29:40,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,499 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 22 treesize of output 23 [2018-12-08 16:29:40,499 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-08 16:29:40,577 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 6 treesize of output 1 [2018-12-08 16:29:40,577 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:29:40,591 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,598 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,649 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-08 16:29:40,654 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 15 treesize of output 1 [2018-12-08 16:29:40,654 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,655 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:29:40,685 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-08 16:29:40,736 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 67 treesize of output 45 [2018-12-08 16:29:40,742 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 9 treesize of output 8 [2018-12-08 16:29:40,742 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,764 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:29:40,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-12-08 16:29:40,830 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 11 treesize of output 10 [2018-12-08 16:29:40,830 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,853 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 19 treesize of output 18 [2018-12-08 16:29:40,855 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 6 treesize of output 1 [2018-12-08 16:29:40,855 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:29:40,864 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,866 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,873 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,879 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:40,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:29:40,894 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 6 variables, input treesize:136, output treesize:9 [2018-12-08 16:29:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:41,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:29:41,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:29:41,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:41,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:41,185 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-08 16:29:41,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 16:29:41,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:41,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:41,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:41,255 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 18 treesize of output 9 [2018-12-08 16:29:41,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-12-08 16:29:41,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:29:41,265 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 8 treesize of output 7 [2018-12-08 16:29:41,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-08 16:29:41,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-12-08 16:29:41,363 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 14 treesize of output 13 [2018-12-08 16:29:41,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,384 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-08 16:29:41,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-12-08 16:29:41,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 16:29:41,633 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 51 treesize of output 50 [2018-12-08 16:29:41,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:41,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2018-12-08 16:29:41,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-08 16:29:41,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:41,882 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 35 treesize of output 46 [2018-12-08 16:29:41,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:41,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:41,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:54 [2018-12-08 16:29:42,793 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2018-12-08 16:29:42,797 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-08 16:29:42,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:42,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, 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 27 [2018-12-08 16:29:42,848 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:42,884 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:42,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-08 16:29:42,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:42,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:42,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:42,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:10 [2018-12-08 16:29:42,946 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:42,946 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-08 16:29:42,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:42,952 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-08 16:29:42,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-08 16:29:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:42,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:43,208 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-12-08 16:29:43,390 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 16:29:43,759 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-08 16:29:44,102 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-12-08 16:29:44,318 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 44 treesize of output 39 [2018-12-08 16:29:44,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:44,357 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 43 treesize of output 36 [2018-12-08 16:29:44,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:44,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 16:29:44,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:88, output treesize:72 [2018-12-08 16:29:44,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-12-08 16:29:44,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:44,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-08 16:29:44,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:44,744 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-08 16:29:44,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:3 [2018-12-08 16:29:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:44,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:29:44,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19, 18] total 45 [2018-12-08 16:29:44,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-08 16:29:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-08 16:29:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1913, Unknown=0, NotChecked=0, Total=2070 [2018-12-08 16:29:44,763 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 46 states. [2018-12-08 16:29:46,370 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-12-08 16:29:46,744 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-12-08 16:29:49,420 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 54 [2018-12-08 16:29:50,030 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-12-08 16:29:50,396 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-08 16:29:50,645 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-12-08 16:29:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:29:52,560 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-12-08 16:29:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 16:29:52,561 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 41 [2018-12-08 16:29:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:29:52,561 INFO L225 Difference]: With dead ends: 86 [2018-12-08 16:29:52,561 INFO L226 Difference]: Without dead ends: 86 [2018-12-08 16:29:52,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 109 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=456, Invalid=3576, Unknown=0, NotChecked=0, Total=4032 [2018-12-08 16:29:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-08 16:29:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-12-08 16:29:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-08 16:29:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-12-08 16:29:52,563 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 41 [2018-12-08 16:29:52,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:29:52,563 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-12-08 16:29:52,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-08 16:29:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-12-08 16:29:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 16:29:52,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:29:52,564 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:29:52,564 INFO L423 AbstractCegarLoop]: === Iteration 18 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:29:52,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:29:52,564 INFO L82 PathProgramCache]: Analyzing trace with hash -267236191, now seen corresponding path program 1 times [2018-12-08 16:29:52,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:29:52,564 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:29:52,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:52,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:52,706 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-08 16:29:52,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 16:29:52,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:52,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:52,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 16:29:52,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-12-08 16:29:52,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:52,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:52,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:52,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-08 16:29:52,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:16 [2018-12-08 16:29:52,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:29:52,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, 2 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-08 16:29:52,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-08 16:29:52,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-08 16:29:52,849 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 14 treesize of output 13 [2018-12-08 16:29:52,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,873 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-08 16:29:52,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-12-08 16:29:52,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-08 16:29:52,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 16:29:52,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:52,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:53,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2018-12-08 16:29:53,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-12-08 16:29:53,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:53,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-12-08 16:29:53,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:53,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:75 [2018-12-08 16:29:53,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 50 [2018-12-08 16:29:53,807 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-08 16:29:53,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 16:29:53,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,839 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 38 treesize of output 18 [2018-12-08 16:29:53,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:10 [2018-12-08 16:29:53,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:53,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, 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-08 16:29:53,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:53,954 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-08 16:29:53,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-08 16:29:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:54,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:55,025 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2018-12-08 16:29:55,443 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-08 16:29:55,694 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-08 16:29:55,953 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-08 16:29:56,203 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:29:56,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:56,214 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 6 treesize of output 1 [2018-12-08 16:29:56,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:56,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:56,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:21 [2018-12-08 16:29:56,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-12-08 16:29:56,720 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 9 treesize of output 8 [2018-12-08 16:29:56,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:56,766 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-12-08 16:29:56,769 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 34 treesize of output 33 [2018-12-08 16:29:56,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:56,833 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 33 treesize of output 39 [2018-12-08 16:29:56,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:56,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-12-08 16:29:56,912 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 6 treesize of output 1 [2018-12-08 16:29:56,913 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:56,922 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 4 [2018-12-08 16:29:56,922 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:56,925 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-12-08 16:29:57,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2018-12-08 16:29:57,029 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 16:29:57,055 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 4 [2018-12-08 16:29:57,055 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,059 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,076 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 15 [2018-12-08 16:29:57,078 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 6 treesize of output 1 [2018-12-08 16:29:57,078 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,082 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:29:57,096 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-08 16:29:57,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:29:57,103 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 2 variables, input treesize:37, output treesize:9 [2018-12-08 16:29:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:57,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:29:57,535 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:29:57,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:29:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:29:57,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:29:57,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:57,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:57,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 16:29:57,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-12-08 16:29:57,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:57,586 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:57,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:57,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-08 16:29:57,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:16 [2018-12-08 16:29:57,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:29:57,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 16:29:57,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2018-12-08 16:29:57,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-08 16:29:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 16:29:57,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,653 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-08 16:29:57,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:37 [2018-12-08 16:29:57,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-12-08 16:29:57,703 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 8 treesize of output 7 [2018-12-08 16:29:57,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:57,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2018-12-08 16:29:57,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-12-08 16:29:57,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:57,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2018-12-08 16:29:57,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:29:57,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:75 [2018-12-08 16:29:57,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 50 [2018-12-08 16:29:57,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 5 treesize of output 1 [2018-12-08 16:29:57,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,978 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 38 treesize of output 18 [2018-12-08 16:29:57,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:57,994 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-08 16:29:57,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:58,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:58,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:29:58,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:10 [2018-12-08 16:29:58,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:29:58,013 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-08 16:29:58,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:29:58,018 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-08 16:29:58,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:13 [2018-12-08 16:29:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:29:58,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:29:59,080 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-12-08 16:29:59,401 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-08 16:29:59,760 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:30:00,251 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:30:00,573 WARN L288 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:30:00,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:00,590 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 6 treesize of output 1 [2018-12-08 16:30:00,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:00,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:00,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:32 [2018-12-08 16:30:00,982 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 37 treesize of output 31 [2018-12-08 16:30:00,985 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 9 treesize of output 8 [2018-12-08 16:30:00,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:01,031 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-12-08 16:30:01,035 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 34 treesize of output 33 [2018-12-08 16:30:01,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:01,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-12-08 16:30:01,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:01,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-12-08 16:30:01,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2018-12-08 16:30:01,205 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:01,231 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 4 [2018-12-08 16:30:01,231 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:01,237 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:01,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 17 treesize of output 15 [2018-12-08 16:30:01,263 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 6 treesize of output 1 [2018-12-08 16:30:01,263 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:01,267 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:01,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:01,294 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-08 16:30:01,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:01,309 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:48, output treesize:31 [2018-12-08 16:30:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:01,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:30:01,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 22, 20] total 51 [2018-12-08 16:30:01,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-08 16:30:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-08 16:30:01,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2470, Unknown=0, NotChecked=0, Total=2652 [2018-12-08 16:30:01,600 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 52 states. [2018-12-08 16:30:05,180 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-08 16:30:06,110 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-12-08 16:30:06,879 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-12-08 16:30:07,180 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-12-08 16:30:08,617 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-08 16:30:08,986 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2018-12-08 16:30:10,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:10,262 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-12-08 16:30:10,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 16:30:10,262 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 42 [2018-12-08 16:30:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:10,263 INFO L225 Difference]: With dead ends: 83 [2018-12-08 16:30:10,263 INFO L226 Difference]: Without dead ends: 83 [2018-12-08 16:30:10,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=479, Invalid=4213, Unknown=0, NotChecked=0, Total=4692 [2018-12-08 16:30:10,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-08 16:30:10,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-12-08 16:30:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-08 16:30:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-12-08 16:30:10,265 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 42 [2018-12-08 16:30:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:10,265 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-12-08 16:30:10,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-08 16:30:10,265 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-12-08 16:30:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 16:30:10,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:10,265 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:10,266 INFO L423 AbstractCegarLoop]: === Iteration 19 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:30:10,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:10,266 INFO L82 PathProgramCache]: Analyzing trace with hash -267246121, now seen corresponding path program 1 times [2018-12-08 16:30:10,266 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:30:10,266 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:30:10,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:10,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:30:10,438 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-08 16:30:10,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 16:30:10,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:10,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:10,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:10,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 24 treesize of output 32 [2018-12-08 16:30:10,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:29 [2018-12-08 16:30:10,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:30:10,546 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 8 treesize of output 7 [2018-12-08 16:30:10,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-08 16:30:10,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-08 16:30:10,606 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 14 treesize of output 13 [2018-12-08 16:30:10,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,633 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-08 16:30:10,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-12-08 16:30:10,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 16:30:10,762 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 51 treesize of output 50 [2018-12-08 16:30:10,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:10,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-12-08 16:30:10,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-08 16:30:10,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:10,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, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-12-08 16:30:10,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:10,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:11,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:11,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:77 [2018-12-08 16:30:11,443 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2018-12-08 16:30:11,447 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 52 treesize of output 47 [2018-12-08 16:30:11,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:11,500 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-12-08 16:30:11,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:11,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-12-08 16:30:11,540 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:11,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-12-08 16:30:11,579 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-08 16:30:11,619 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 33 treesize of output 21 [2018-12-08 16:30:11,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:11,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 16:30:11,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 16:30:11,661 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2018-12-08 16:30:11,770 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:11,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-12-08 16:30:11,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:11,777 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-08 16:30:11,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-12-08 16:30:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:11,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:30:12,618 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-12-08 16:30:12,831 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-08 16:30:12,995 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:30:13,162 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:30:13,747 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 72 treesize of output 50 [2018-12-08 16:30:13,750 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 9 treesize of output 8 [2018-12-08 16:30:13,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:13,809 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 57 [2018-12-08 16:30:13,991 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2018-12-08 16:30:13,994 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 31 treesize of output 30 [2018-12-08 16:30:13,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:13,997 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 35 treesize of output 34 [2018-12-08 16:30:13,997 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,129 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 22 treesize of output 23 [2018-12-08 16:30:14,129 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,245 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-08 16:30:14,250 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 15 treesize of output 1 [2018-12-08 16:30:14,250 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,252 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2018-12-08 16:30:14,362 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 26 treesize of output 20 [2018-12-08 16:30:14,362 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,393 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 12 [2018-12-08 16:30:14,393 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-12-08 16:30:14,429 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:14,440 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2018-12-08 16:30:14,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-12-08 16:30:14,489 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:14,524 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 17 [2018-12-08 16:30:14,525 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-12-08 16:30:14,549 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,554 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:14,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:14,596 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-08 16:30:14,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:14,604 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 3 variables, input treesize:72, output treesize:13 [2018-12-08 16:30:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:16,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:30:16,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:30:16,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:16,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:30:16,839 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-08 16:30:16,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:16,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:16,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 16:30:16,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:16,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:16,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:16,852 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 18 treesize of output 9 [2018-12-08 16:30:16,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:16,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:16,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2018-12-08 16:30:18,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:30:18,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, 1 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-08 16:30:18,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:18,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:18,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:18,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-12-08 16:30:19,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-08 16:30:19,025 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 14 treesize of output 13 [2018-12-08 16:30:19,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:19,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:19,043 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-08 16:30:19,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-12-08 16:30:19,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-08 16:30:19,288 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 42 treesize of output 41 [2018-12-08 16:30:19,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:19,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:19,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:19,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-12-08 16:30:19,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-12-08 16:30:19,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:19,535 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 28 treesize of output 37 [2018-12-08 16:30:19,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:19,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:19,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:19,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:45 [2018-12-08 16:30:20,685 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2018-12-08 16:30:20,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:20,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-12-08 16:30:20,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:20,735 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 40 treesize of output 35 [2018-12-08 16:30:20,735 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:20,772 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 17 treesize of output 4 [2018-12-08 16:30:20,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:20,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:20,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:20,784 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:10 [2018-12-08 16:30:20,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:20,831 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-08 16:30:20,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:20,836 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-08 16:30:20,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:13 [2018-12-08 16:30:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:20,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:30:20,852 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 6 treesize of output 1 [2018-12-08 16:30:20,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:20,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:20,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2018-12-08 16:30:21,291 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-08 16:30:21,442 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-12-08 16:30:21,721 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-08 16:30:22,070 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-08 16:30:33,406 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 68 treesize of output 46 [2018-12-08 16:30:33,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-08 16:30:33,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:33,485 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 53 [2018-12-08 16:30:33,641 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-12-08 16:30:33,644 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 31 treesize of output 30 [2018-12-08 16:30:33,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:33,734 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 22 treesize of output 23 [2018-12-08 16:30:33,734 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:33,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:33,817 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 30 treesize of output 25 [2018-12-08 16:30:33,822 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 21 treesize of output 4 [2018-12-08 16:30:33,822 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:33,824 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:33,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-12-08 16:30:33,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-12-08 16:30:33,841 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:33,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-12-08 16:30:33,880 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:33,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:33,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:33,937 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-08 16:30:33,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:33,944 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:68, output treesize:9 [2018-12-08 16:30:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:33,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:30:33,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19, 18] total 56 [2018-12-08 16:30:33,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-08 16:30:33,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-08 16:30:33,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2953, Unknown=5, NotChecked=0, Total=3192 [2018-12-08 16:30:33,972 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 57 states. [2018-12-08 16:30:35,639 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-12-08 16:30:37,004 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-08 16:30:37,800 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-12-08 16:30:38,086 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-08 16:30:39,978 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-12-08 16:30:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:40,910 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-12-08 16:30:40,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 16:30:40,911 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 42 [2018-12-08 16:30:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:40,911 INFO L225 Difference]: With dead ends: 82 [2018-12-08 16:30:40,911 INFO L226 Difference]: Without dead ends: 82 [2018-12-08 16:30:40,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1789 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=602, Invalid=5093, Unknown=5, NotChecked=0, Total=5700 [2018-12-08 16:30:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-08 16:30:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-08 16:30:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-08 16:30:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-12-08 16:30:40,913 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 42 [2018-12-08 16:30:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:40,913 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-12-08 16:30:40,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-08 16:30:40,913 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-12-08 16:30:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-08 16:30:40,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:40,914 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:40,914 INFO L423 AbstractCegarLoop]: === Iteration 20 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:30:40,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash 561090647, now seen corresponding path program 1 times [2018-12-08 16:30:40,914 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:30:40,914 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 16:30:40,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:41,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:30:41,036 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-08 16:30:41,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2018-12-08 16:30:41,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:41,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:41,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 16:30:41,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-12-08 16:30:41,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 16:30:41,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 16:30:41,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,102 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-08 16:30:41,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:34 [2018-12-08 16:30:41,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-08 16:30:41,244 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-08 16:30:41,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-12-08 16:30:41,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:41,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-12-08 16:30:41,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,312 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-08 16:30:41,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-12-08 16:30:41,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:41,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:30:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-12-08 16:30:41,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:41,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-08 16:30:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:41,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:30:41,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:30:41,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:42,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:30:42,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:42,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:42,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 16:30:42,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 16:30:42,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-08 16:30:42,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 16:30:42,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,144 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-08 16:30:42,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-12-08 16:30:42,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-08 16:30:42,384 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:42,385 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 14 treesize of output 10 [2018-12-08 16:30:42,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:13 [2018-12-08 16:30:42,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:42,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-12-08 16:30:42,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,524 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-08 16:30:42,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-12-08 16:30:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:42,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:30:42,657 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 6 treesize of output 1 [2018-12-08 16:30:42,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:42,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-12-08 16:30:43,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-12-08 16:30:43,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:43,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:43,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-08 16:30:43,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:43,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:30:43,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15, 15] total 45 [2018-12-08 16:30:43,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-08 16:30:43,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-08 16:30:43,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1920, Unknown=0, NotChecked=0, Total=2070 [2018-12-08 16:30:43,402 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 46 states. [2018-12-08 16:30:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:30:46,101 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-12-08 16:30:46,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 16:30:46,101 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 42 [2018-12-08 16:30:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:30:46,101 INFO L225 Difference]: With dead ends: 76 [2018-12-08 16:30:46,101 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 16:30:46,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=288, Invalid=2904, Unknown=0, NotChecked=0, Total=3192 [2018-12-08 16:30:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 16:30:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-08 16:30:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-08 16:30:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-12-08 16:30:46,103 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 42 [2018-12-08 16:30:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:30:46,103 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-12-08 16:30:46,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-08 16:30:46,103 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-12-08 16:30:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 16:30:46,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:30:46,104 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:30:46,104 INFO L423 AbstractCegarLoop]: === Iteration 21 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:30:46,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:30:46,104 INFO L82 PathProgramCache]: Analyzing trace with hash -2064000817, now seen corresponding path program 1 times [2018-12-08 16:30:46,104 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:30:46,104 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/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-08 16:30:46,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:46,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:30:46,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, 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-08 16:30:46,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:10 [2018-12-08 16:30:46,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:46,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:46,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 16:30:46,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-12-08 16:30:46,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:46,320 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:46,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:46,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-08 16:30:46,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2018-12-08 16:30:46,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:30:46,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 16:30:46,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-12-08 16:30:46,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-08 16:30:46,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-08 16:30:46,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,442 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-08 16:30:46,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-12-08 16:30:46,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-12-08 16:30:46,542 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 8 treesize of output 7 [2018-12-08 16:30:46,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:46,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-12-08 16:30:46,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-12-08 16:30:46,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:46,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-12-08 16:30:46,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:46,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:46,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:81 [2018-12-08 16:30:47,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 58 [2018-12-08 16:30:47,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 24 [2018-12-08 16:30:47,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:47,403 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-08 16:30:47,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:47,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 5 treesize of output 1 [2018-12-08 16:30:47,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:47,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:47,430 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-08 16:30:47,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:24 [2018-12-08 16:30:47,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:47,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-08 16:30:47,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:47,557 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-08 16:30:47,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:25 [2018-12-08 16:30:47,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:47,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:47,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-12-08 16:30:47,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:47,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:47,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:27 [2018-12-08 16:30:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:47,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:30:49,123 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-12-08 16:30:49,444 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-08 16:30:49,892 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-08 16:30:50,413 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-08 16:30:51,225 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,245 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 63 treesize of output 69 [2018-12-08 16:30:51,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 56 treesize of output 50 [2018-12-08 16:30:51,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:51,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:51,334 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 59 treesize of output 9 [2018-12-08 16:30:51,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:51,402 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:51,405 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 61 treesize of output 48 [2018-12-08 16:30:51,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:51,408 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,409 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,409 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 58 treesize of output 49 [2018-12-08 16:30:51,410 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:51,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:30:51,584 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 77 [2018-12-08 16:30:51,791 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-12-08 16:30:51,795 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,799 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:51,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-12-08 16:30:51,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:51,807 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,807 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,808 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 49 [2018-12-08 16:30:51,808 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:51,901 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:51,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-12-08 16:30:51,904 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:51,908 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,915 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,915 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:51,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:51,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:51,920 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 87 [2018-12-08 16:30:51,920 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:51,973 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:30:52,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-12-08 16:30:52,100 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:128, output treesize:189 [2018-12-08 16:30:52,519 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-08 16:30:52,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 54 [2018-12-08 16:30:52,534 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 9 treesize of output 8 [2018-12-08 16:30:52,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,557 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:52,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-12-08 16:30:52,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-08 16:30:52,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:52,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 46 [2018-12-08 16:30:52,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-12-08 16:30:52,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,637 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 40 treesize of output 35 [2018-12-08 16:30:52,658 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 15 treesize of output 1 [2018-12-08 16:30:52,659 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,666 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 4 [2018-12-08 16:30:52,666 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,667 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,669 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,769 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 78 treesize of output 55 [2018-12-08 16:30:52,772 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 9 treesize of output 8 [2018-12-08 16:30:52,772 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,844 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2018-12-08 16:30:52,853 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 43 treesize of output 44 [2018-12-08 16:30:52,853 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:52,943 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 44 treesize of output 43 [2018-12-08 16:30:52,943 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:53,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:53,032 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 0 case distinctions, treesize of input 44 treesize of output 45 [2018-12-08 16:30:53,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 24 treesize of output 27 [2018-12-08 16:30:53,040 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:53,076 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 32 treesize of output 30 [2018-12-08 16:30:53,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:53,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 4 [2018-12-08 16:30:53,125 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:53,127 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:53,134 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:53,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 76 [2018-12-08 16:30:53,308 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:30:53,308 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:53,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:53,558 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:53,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 61 [2018-12-08 16:30:53,576 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:53,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:53,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 35 [2018-12-08 16:30:53,888 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:54,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 39 [2018-12-08 16:30:54,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2018-12-08 16:30:54,427 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:54,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2018-12-08 16:30:54,462 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:54,475 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:54,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 45 [2018-12-08 16:30:54,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:54,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2018-12-08 16:30:54,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 4 [2018-12-08 16:30:54,710 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:54,712 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:54,738 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:54,739 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:54,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:54,740 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:54,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 50 [2018-12-08 16:30:54,779 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:54,780 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 21 treesize of output 10 [2018-12-08 16:30:54,780 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:54,795 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:54,821 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:54,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:54,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 45 [2018-12-08 16:30:55,057 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 14 [2018-12-08 16:30:55,058 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:55,059 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:55,060 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:30:55,060 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 20 treesize of output 11 [2018-12-08 16:30:55,060 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:55,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2018-12-08 16:30:55,119 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-12-08 16:30:55,139 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:30:55,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2018-12-08 16:30:55,326 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 26 treesize of output 20 [2018-12-08 16:30:55,327 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:55,354 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 12 [2018-12-08 16:30:55,354 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:55,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:55,378 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 23 treesize of output 9 [2018-12-08 16:30:55,379 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:55,385 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:55,397 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:55,421 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:55,430 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:30:55,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 16:30:55,474 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 9 variables, input treesize:240, output treesize:35 [2018-12-08 16:30:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:55,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:30:55,980 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:30:55,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:30:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:30:56,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:30:56,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:56,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:56,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-08 16:30:56,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-12-08 16:30:56,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:56,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:56,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:56,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-08 16:30:56,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:16 [2018-12-08 16:30:56,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:30:56,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 16:30:56,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2018-12-08 16:30:56,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2018-12-08 16:30:56,786 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 14 treesize of output 13 [2018-12-08 16:30:56,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:56,819 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-08 16:30:56,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-12-08 16:30:57,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-12-08 16:30:57,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, 1 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-08 16:30:57,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:57,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:57,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:57,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2018-12-08 16:30:57,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2018-12-08 16:30:57,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:57,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 54 [2018-12-08 16:30:57,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:57,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:57,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:57,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:71 [2018-12-08 16:30:58,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 52 [2018-12-08 16:30:58,978 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-08 16:30:58,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:59,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2018-12-08 16:30:59,003 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:59,020 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-08 16:30:59,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:59,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:30:59,035 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-08 16:30:59,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:20 [2018-12-08 16:30:59,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:59,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-08 16:30:59,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:59,249 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-08 16:30:59,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2018-12-08 16:30:59,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:59,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:30:59,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 38 [2018-12-08 16:30:59,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:30:59,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:30:59,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2018-12-08 16:30:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:30:59,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:31:00,975 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2018-12-08 16:31:01,369 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-08 16:31:01,678 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-08 16:31:01,959 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-08 16:31:02,769 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:02,792 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 57 treesize of output 65 [2018-12-08 16:31:02,867 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 52 treesize of output 46 [2018-12-08 16:31:02,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:02,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:02,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 53 treesize of output 4 [2018-12-08 16:31:02,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:02,942 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:02,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:02,945 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 59 treesize of output 44 [2018-12-08 16:31:02,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:02,950 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:02,950 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:02,951 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 56 treesize of output 45 [2018-12-08 16:31:02,951 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:02,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:31:03,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-12-08 16:31:03,019 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:67, output treesize:119 [2018-12-08 16:31:03,350 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-08 16:31:03,362 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 61 [2018-12-08 16:31:03,368 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 9 treesize of output 8 [2018-12-08 16:31:03,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:03,455 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 58 [2018-12-08 16:31:03,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 44 treesize of output 43 [2018-12-08 16:31:03,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:03,562 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 43 treesize of output 44 [2018-12-08 16:31:03,562 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:03,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 78 [2018-12-08 16:31:03,740 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 16:31:03,740 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:04,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:04,009 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:04,009 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 46 treesize of output 46 [2018-12-08 16:31:04,009 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:04,239 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 38 treesize of output 39 [2018-12-08 16:31:04,239 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:04,889 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:04,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:04,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:04,893 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 54 treesize of output 47 [2018-12-08 16:31:04,931 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:04,934 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:04,934 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:04,935 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 16 [2018-12-08 16:31:04,935 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:04,947 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:05,127 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 35 treesize of output 34 [2018-12-08 16:31:05,163 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 6 treesize of output 1 [2018-12-08 16:31:05,164 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:05,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:31:05,180 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:05,189 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:05,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:05,475 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 46 treesize of output 39 [2018-12-08 16:31:05,518 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 15 treesize of output 1 [2018-12-08 16:31:05,518 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:05,529 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 6 treesize of output 1 [2018-12-08 16:31:05,529 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:05,535 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:05,630 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:31:05,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 76 [2018-12-08 16:31:05,839 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:05,845 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:05,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 61 [2018-12-08 16:31:05,857 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-08 16:31:06,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:06,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 35 [2018-12-08 16:31:06,579 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:06,892 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 37 treesize of output 31 [2018-12-08 16:31:06,901 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 6 treesize of output 1 [2018-12-08 16:31:06,901 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:06,907 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:07,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-12-08 16:31:07,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2018-12-08 16:31:07,347 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:07,350 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:07,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2018-12-08 16:31:07,785 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 32 treesize of output 26 [2018-12-08 16:31:07,786 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:07,829 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:07,829 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:07,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, 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 20 [2018-12-08 16:31:07,830 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:07,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2018-12-08 16:31:07,873 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-12-08 16:31:07,897 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:31:07,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-12-08 16:31:07,915 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 32 treesize of output 26 [2018-12-08 16:31:07,916 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:07,952 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 23 treesize of output 15 [2018-12-08 16:31:07,953 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:07,980 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,011 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:31:08,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:31:08,054 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-08 16:31:08,189 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 83 treesize of output 60 [2018-12-08 16:31:08,196 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 9 treesize of output 8 [2018-12-08 16:31:08,197 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,237 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:08,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-12-08 16:31:08,253 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 11 treesize of output 10 [2018-12-08 16:31:08,253 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:08,280 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:08,285 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:08,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 50 [2018-12-08 16:31:08,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:08,301 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 21 treesize of output 16 [2018-12-08 16:31:08,301 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,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 19 treesize of output 18 [2018-12-08 16:31:08,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 6 treesize of output 1 [2018-12-08 16:31:08,335 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-08 16:31:08,346 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,348 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,356 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,363 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,376 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:08,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 16:31:08,419 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 6 variables, input treesize:183, output treesize:46 [2018-12-08 16:31:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:31:09,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:31:09,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 23, 22] total 81 [2018-12-08 16:31:09,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-08 16:31:09,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-08 16:31:09,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=6308, Unknown=0, NotChecked=0, Total=6642 [2018-12-08 16:31:09,278 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 82 states. [2018-12-08 16:31:13,255 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2018-12-08 16:31:13,705 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2018-12-08 16:31:14,782 WARN L180 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 94 [2018-12-08 16:31:15,182 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-08 16:31:17,271 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-08 16:31:17,761 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-08 16:31:20,243 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-12-08 16:31:24,834 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-12-08 16:31:25,245 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-12-08 16:31:28,047 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2018-12-08 16:31:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:31:30,917 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-12-08 16:31:30,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 16:31:30,918 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 43 [2018-12-08 16:31:30,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:31:30,920 INFO L225 Difference]: With dead ends: 80 [2018-12-08 16:31:30,920 INFO L226 Difference]: Without dead ends: 80 [2018-12-08 16:31:30,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3621 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=826, Invalid=9886, Unknown=0, NotChecked=0, Total=10712 [2018-12-08 16:31:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-08 16:31:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-12-08 16:31:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 16:31:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-12-08 16:31:30,923 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 43 [2018-12-08 16:31:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:31:30,924 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-12-08 16:31:30,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-08 16:31:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-12-08 16:31:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 16:31:30,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:31:30,924 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:31:30,924 INFO L423 AbstractCegarLoop]: === Iteration 22 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:31:30,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:31:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash 884061475, now seen corresponding path program 1 times [2018-12-08 16:31:30,925 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:31:30,925 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 16:31:30,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:31:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:31:31,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:31:31,113 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-08 16:31:31,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-08 16:31:31,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:31,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:31,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:31,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 24 treesize of output 32 [2018-12-08 16:31:31,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:29 [2018-12-08 16:31:31,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:31:31,188 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 8 treesize of output 7 [2018-12-08 16:31:31,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-12-08 16:31:31,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-08 16:31:31,249 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 14 treesize of output 13 [2018-12-08 16:31:31,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,277 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-08 16:31:31,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-12-08 16:31:31,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 61 [2018-12-08 16:31:31,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2018-12-08 16:31:31,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,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, 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-08 16:31:31,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:31:31,540 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:61, output treesize:57 [2018-12-08 16:31:31,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 49 [2018-12-08 16:31:31,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:31,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 46 [2018-12-08 16:31:31,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:31,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:31:31,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:77 [2018-12-08 16:31:32,302 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 59 [2018-12-08 16:31:32,306 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-08 16:31:32,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:32,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:32,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-12-08 16:31:32,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:32,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 30 treesize of output 25 [2018-12-08 16:31:32,415 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:32,461 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 51 treesize of output 33 [2018-12-08 16:31:32,461 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:32,504 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 33 treesize of output 21 [2018-12-08 16:31:32,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:32,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:32,532 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-08 16:31:32,532 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:80, output treesize:26 [2018-12-08 16:31:32,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:32,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2018-12-08 16:31:32,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-08 16:31:32,694 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 2 xjuncts. [2018-12-08 16:31:32,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-12-08 16:31:32,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:32,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:32,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-12-08 16:31:32,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:32,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:31:32,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-12-08 16:31:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:31:32,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:31:33,898 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-12-08 16:31:34,202 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-08 16:31:34,484 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:31:34,788 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-08 16:31:35,276 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 48 treesize of output 42 [2018-12-08 16:31:35,278 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 9 treesize of output 8 [2018-12-08 16:31:35,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,328 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 59 [2018-12-08 16:31:35,336 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 44 treesize of output 45 [2018-12-08 16:31:35,336 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-12-08 16:31:35,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,450 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 44 treesize of output 38 [2018-12-08 16:31:35,466 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 13 [2018-12-08 16:31:35,466 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,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 8 treesize of output 1 [2018-12-08 16:31:35,478 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,482 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2018-12-08 16:31:35,574 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 17 [2018-12-08 16:31:35,574 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 16:31:35,612 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-08 16:31:35,628 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,639 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:35,643 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-08 16:31:35,643 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:48, output treesize:13 [2018-12-08 16:31:37,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:31:37,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 16:31:37,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 16:31:37,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:31:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 16:31:37,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 16:31:37,901 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-08 16:31:37,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:37,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:37,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-08 16:31:37,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:37,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:37,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:37,911 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 18 treesize of output 9 [2018-12-08 16:31:37,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:37,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:37,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2018-12-08 16:31:37,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-12-08 16:31:37,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-08 16:31:37,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:37,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:37,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:37,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2018-12-08 16:31:38,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-08 16:31:38,087 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 14 treesize of output 13 [2018-12-08 16:31:38,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:38,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:38,107 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-08 16:31:38,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-12-08 16:31:38,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-12-08 16:31:38,367 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 42 treesize of output 41 [2018-12-08 16:31:38,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:38,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:38,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:31:38,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-12-08 16:31:38,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-12-08 16:31:38,588 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:38,591 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 28 treesize of output 37 [2018-12-08 16:31:38,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:38,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:38,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:31:38,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:48 [2018-12-08 16:31:39,814 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2018-12-08 16:31:39,818 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 39 treesize of output 34 [2018-12-08 16:31:39,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:39,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2018-12-08 16:31:39,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:39,906 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 21 treesize of output 9 [2018-12-08 16:31:39,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:39,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:39,932 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-08 16:31:39,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:14 [2018-12-08 16:31:40,043 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 20 treesize of output 16 [2018-12-08 16:31:40,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:40,048 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-08 16:31:40,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-12-08 16:31:40,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:40,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:40,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 30 [2018-12-08 16:31:40,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:40,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 16:31:40,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-12-08 16:31:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:31:40,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 16:31:40,282 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:40,291 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 28 treesize of output 40 [2018-12-08 16:31:40,331 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 8 [2018-12-08 16:31:40,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:40,344 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:40,344 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 16:31:40,345 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 18 [2018-12-08 16:31:40,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:40,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:31:40,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:31:40,365 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:41 [2018-12-08 16:31:41,305 WARN L180 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2018-12-08 16:31:41,591 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-08 16:31:41,753 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 16:31:41,913 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 16:31:42,699 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 50 treesize of output 43 [2018-12-08 16:31:42,703 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 9 treesize of output 8 [2018-12-08 16:31:42,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:42,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 16:31:42,732 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 0 case distinctions, treesize of input 32 treesize of output 35 [2018-12-08 16:31:42,741 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 18 treesize of output 23 [2018-12-08 16:31:42,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:42,756 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 15 [2018-12-08 16:31:42,761 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 15 treesize of output 1 [2018-12-08 16:31:42,762 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 16:31:42,764 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:42,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:42,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 16:31:42,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 16:31:42,791 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:66, output treesize:31 [2018-12-08 16:31:46,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 16:31:46,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 16:31:46,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21, 20] total 66 [2018-12-08 16:31:46,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-08 16:31:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-08 16:31:46,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=4132, Unknown=3, NotChecked=0, Total=4422 [2018-12-08 16:31:46,954 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 67 states. [2018-12-08 16:31:52,893 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-12-08 16:31:53,284 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-12-08 16:31:56,508 WARN L180 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-12-08 16:32:01,216 WARN L180 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-12-08 16:32:01,537 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-12-08 16:32:09,113 WARN L180 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-12-08 16:32:15,566 WARN L180 SmtUtils]: Spent 6.21 s on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-12-08 16:32:22,429 WARN L180 SmtUtils]: Spent 6.17 s on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2018-12-08 16:32:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 16:32:23,861 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-08 16:32:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 16:32:23,861 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 44 [2018-12-08 16:32:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 16:32:23,862 INFO L225 Difference]: With dead ends: 77 [2018-12-08 16:32:23,862 INFO L226 Difference]: Without dead ends: 77 [2018-12-08 16:32:23,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2699 ImplicationChecksByTransitivity, 44.7s TimeCoverageRelationStatistics Valid=698, Invalid=6955, Unknown=3, NotChecked=0, Total=7656 [2018-12-08 16:32:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-08 16:32:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-12-08 16:32:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-08 16:32:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-12-08 16:32:23,864 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 44 [2018-12-08 16:32:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 16:32:23,864 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-12-08 16:32:23,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-08 16:32:23,864 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-12-08 16:32:23,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 16:32:23,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 16:32:23,864 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 16:32:23,865 INFO L423 AbstractCegarLoop]: === Iteration 23 === [_destroy_in_nondeterministic_orderErr9ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr10ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr19ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr22ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr16ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr28ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr31ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr21ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr3REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr6ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr5ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr2REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr27ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr7ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr29ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr17ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr25ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr15ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr12ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr18ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr23ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr20ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr4ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr8ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr13ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr14ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr1REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr26ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr24ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr0REQUIRES_VIOLATION, _destroy_in_nondeterministic_orderErr30ASSERT_VIOLATIONMEMORY_FREE, _destroy_in_nondeterministic_orderErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr10REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr11REQUIRES_VIOLATION, dll_circular_createErr8REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr9REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION]=== [2018-12-08 16:32:23,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 16:32:23,865 INFO L82 PathProgramCache]: Analyzing trace with hash 365775783, now seen corresponding path program 1 times [2018-12-08 16:32:23,865 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 16:32:23,865 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b04775cb-73dd-473f-aa11-c7900932968b/bin-2019/utaipan/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 16:32:23,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 16:32:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:32:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 16:32:24,305 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 16:32:24,321 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-08 16:32:24,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:32:24 BoogieIcfgContainer [2018-12-08 16:32:24,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 16:32:24,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 16:32:24,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 16:32:24,342 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 16:32:24,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:28:53" (3/4) ... [2018-12-08 16:32:24,345 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 16:32:24,345 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 16:32:24,346 INFO L168 Benchmark]: Toolchain (without parser) took 211695.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -234.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:32:24,346 INFO L168 Benchmark]: CDTParser took 0.19 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-08 16:32:24,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2018-12-08 16:32:24,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 16:32:24,347 INFO L168 Benchmark]: Boogie Preprocessor took 21.13 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-08 16:32:24,347 INFO L168 Benchmark]: RCFGBuilder took 308.08 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: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2018-12-08 16:32:24,347 INFO L168 Benchmark]: TraceAbstraction took 211055.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.2 MB). Peak memory consumption was 339.5 MB. Max. memory is 11.5 GB. [2018-12-08 16:32:24,347 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 16:32:24,348 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.19 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 279.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -188.7 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.13 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 308.08 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: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 211055.71 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.2 MB). Peak memory consumption was 339.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; VAL [len=3] [L618] CALL, EXPR dll_circular_create(len) VAL [\old(len)=3] [L564] DLL last = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}] [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}] [L568] last->next = last VAL [\old(len)=3, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}] [L569] last->prev = last VAL [\old(len)=3, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}] [L570] DLL head = last; VAL [\old(len)=3, head={-513614417:0}, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={-513614417:0}, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={47522548:0}, new_head={47522548:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-513614417:0}, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={47522548:0}, new_head={47522548:0}] [L576] new_head->next = head VAL [\old(len)=3, head={-513614417:0}, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={47522548:0}, new_head={47522548:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={-513614417:0}, last={-513614417:0}, len=3, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={47522548:0}, new_head={47522548:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={47522548:0}, last={-513614417:0}, len=2, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={47522548:0}, new_head={47522548:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={47522548:0}, last={-513614417:0}, len=2, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={47522548:0}, last={-513614417:0}, len=2, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L576] new_head->next = head VAL [\old(len)=3, head={47522548:0}, last={-513614417:0}, len=2, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={47522548:0}, last={-513614417:0}, len=2, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={472502081:0}, last={-513614417:0}, len=1, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={472502081:0}, last={-513614417:0}, len=1, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L581] last->next = head VAL [\old(len)=3, head={472502081:0}, last={-513614417:0}, len=1, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L582] head->prev = last VAL [\old(len)=3, head={472502081:0}, last={-513614417:0}, len=1, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L583] return head; VAL [\old(len)=3, \result={472502081:0}, head={472502081:0}, last={-513614417:0}, len=1, malloc(sizeof(struct node))={-513614417:0}, malloc(sizeof(struct node))={472502081:0}, new_head={472502081:0}] [L618] RET, EXPR dll_circular_create(len) VAL [dll_circular_create(len)={472502081:0}, len=3] [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) VAL [head={472502081:0}] [L586] EXPR head->prev VAL [head={472502081:0}, head={472502081:0}, head->prev={-513614417:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={472502081:0}, head={472502081:0}, head->next={47522548:0}, pred={-513614417:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={472502081:0}, head={472502081:0}, pred={-513614417:0}, succ={47522548:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={472502081:0}, head={472502081:0}, pred={-513614417:0}, succ={47522548:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) VAL [head={472502081:0}, len=3] [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 120 locations, 45 error locations. UNSAFE Result, 211.0s OverallTime, 23 OverallIterations, 2 TraceHistogramMax, 101.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1592 SDtfs, 2312 SDslu, 11641 SDs, 0 SdLazy, 13627 SolverSat, 767 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 36.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2022 GetRequests, 1253 SyntacticMatches, 60 SemanticMatches, 709 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 13783 ImplicationChecksByTransitivity, 123.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 45 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 106.5s InterpolantComputationTime, 1110 NumberOfCodeBlocks, 1110 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1816 ConstructedInterpolants, 345 QuantifiedInterpolants, 1070293 SizeOfPredicates, 474 NumberOfNonLiveVariables, 4132 ConjunctsInSsa, 731 ConjunctsInUnsatCore, 54 InterpolantComputations, 12 PerfectInterpolantSequences, 56/299 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...