./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a072faa67a1e34154107ea3f600c480af03b38c6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a072faa67a1e34154107ea3f600c480af03b38c6 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:00:04,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:00:04,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:00:04,943 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:00:04,943 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:00:04,944 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:00:04,945 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:00:04,946 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:00:04,947 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:00:04,948 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:00:04,948 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:00:04,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:00:04,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:00:04,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:00:04,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:00:04,951 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:00:04,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:00:04,953 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:00:04,954 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:00:04,955 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:00:04,956 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:00:04,957 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:00:04,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:00:04,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:00:04,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:00:04,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:00:04,960 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:00:04,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:00:04,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:00:04,961 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:00:04,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:00:04,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:00:04,962 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:00:04,962 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:00:04,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:00:04,963 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:00:04,964 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 02:00:04,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:00:04,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:00:04,974 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:00:04,974 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:00:04,974 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:00:04,975 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:00:04,975 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:00:04,975 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:00:04,975 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:00:04,975 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:00:04,975 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:00:04,975 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:00:04,976 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:00:04,976 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:00:04,976 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:00:04,976 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:00:04,977 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:00:04,977 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:00:04,977 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:00:04,977 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:00:04,977 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:00:04,977 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:00:04,978 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:00:04,978 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:00:04,978 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:00:04,978 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:00:04,978 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:00:04,978 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:00:04,978 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:00:04,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:00:04,979 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:00:04,979 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:00:04,979 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:00:04,979 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:00:04,979 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:00:04,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:00:04,980 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:00:04,980 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_436407e3-2cdf-40ef-b557-ea256fec49c1/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 ! call(__VERIFIER_error())) ) 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 -> a072faa67a1e34154107ea3f600c480af03b38c6 [2018-11-23 02:00:05,002 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:00:05,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:00:05,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:00:05,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:00:05,015 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:00:05,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 02:00:05,052 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data/6aa1cd626/611424755e5e4bf09111ca234be385ef/FLAG0e7ef772b [2018-11-23 02:00:05,479 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:00:05,480 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 02:00:05,486 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data/6aa1cd626/611424755e5e4bf09111ca234be385ef/FLAG0e7ef772b [2018-11-23 02:00:05,495 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data/6aa1cd626/611424755e5e4bf09111ca234be385ef [2018-11-23 02:00:05,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:00:05,497 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:00:05,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:00:05,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:00:05,500 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:00:05,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8dd392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05, skipping insertion in model container [2018-11-23 02:00:05,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:00:05,535 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:00:05,730 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:00:05,737 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:00:05,814 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:00:05,847 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:00:05,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05 WrapperNode [2018-11-23 02:00:05,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:00:05,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:00:05,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:00:05,848 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:00:05,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:00:05,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:00:05,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:00:05,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:00:05,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... [2018-11-23 02:00:05,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:00:05,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:00:05,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:00:05,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:00:05,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:00:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-11-23 02:00:05,944 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-11-23 02:00:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-23 02:00:05,944 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-23 02:00:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:00:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-11-23 02:00:05,945 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-11-23 02:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 02:00:05,945 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 02:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 02:00:05,945 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 02:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:00:05,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:00:05,946 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 02:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 02:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-23 02:00:05,946 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-23 02:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:00:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:00:05,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:00:06,250 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:00:06,251 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 02:00:06,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:00:06 BoogieIcfgContainer [2018-11-23 02:00:06,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:00:06,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:00:06,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:00:06,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:00:06,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:00:05" (1/3) ... [2018-11-23 02:00:06,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21525ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:00:06, skipping insertion in model container [2018-11-23 02:00:06,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:00:05" (2/3) ... [2018-11-23 02:00:06,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21525ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:00:06, skipping insertion in model container [2018-11-23 02:00:06,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:00:06" (3/3) ... [2018-11-23 02:00:06,257 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 02:00:06,265 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:00:06,271 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:00:06,284 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:00:06,310 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:00:06,310 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:00:06,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:00:06,310 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:00:06,310 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:00:06,310 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:00:06,311 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:00:06,311 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:00:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-23 02:00:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 02:00:06,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:06,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:06,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:06,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:06,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1670761163, now seen corresponding path program 1 times [2018-11-23 02:00:06,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:00:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:06,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:00:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:00:06,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:06,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:00:06,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:00:06,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:00:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:00:06,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:00:06,473 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-23 02:00:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:06,491 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2018-11-23 02:00:06,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:00:06,492 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-23 02:00:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:06,500 INFO L225 Difference]: With dead ends: 97 [2018-11-23 02:00:06,500 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 02:00:06,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:00:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 02:00:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 02:00:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 02:00:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-23 02:00:06,529 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2018-11-23 02:00:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:06,530 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-23 02:00:06,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:00:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 02:00:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 02:00:06,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:06,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:06,532 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:06,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2083918040, now seen corresponding path program 1 times [2018-11-23 02:00:06,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:00:06,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:06,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:00:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:00:06,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:06,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:00:06,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:00:06,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:00:06,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:00:06,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:00:06,608 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 5 states. [2018-11-23 02:00:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:06,669 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2018-11-23 02:00:06,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:00:06,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 02:00:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:06,671 INFO L225 Difference]: With dead ends: 75 [2018-11-23 02:00:06,671 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 02:00:06,672 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-11-23 02:00:06,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 02:00:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-23 02:00:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:00:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 02:00:06,679 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2018-11-23 02:00:06,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:06,679 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 02:00:06,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:00:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 02:00:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 02:00:06,680 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:06,680 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:06,681 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:06,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:06,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1251006308, now seen corresponding path program 1 times [2018-11-23 02:00:06,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:00:06,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:06,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:00:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:00:06,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:00:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:00:06,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:00:06,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:00:06,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:00:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:00:06,754 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-11-23 02:00:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:06,788 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-23 02:00:06,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:00:06,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 02:00:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:06,790 INFO L225 Difference]: With dead ends: 69 [2018-11-23 02:00:06,790 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 02:00:06,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-23 02:00:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 02:00:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2018-11-23 02:00:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 02:00:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 02:00:06,797 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2018-11-23 02:00:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:06,797 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 02:00:06,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:00:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 02:00:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 02:00:06,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:06,798 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 02:00:06,798 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:06,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash 811064934, now seen corresponding path program 1 times [2018-11-23 02:00:06,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:00:06,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:06,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:06,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:00:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:00:06,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:00:06,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:00:06,871 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 51 with the following transitions: [2018-11-23 02:00:06,872 INFO L202 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [40], [43], [50], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [97], [98], [104], [105], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-11-23 02:00:06,896 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:00:06,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:00:07,100 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 02:00:07,101 INFO L272 AbstractInterpreter]: Visited 35 different actions 72 times. Merged at 10 different actions 15 times. Never widened. Performed 742 root evaluator evaluations with a maximum evaluation depth of 4. Performed 742 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 31 variables. [2018-11-23 02:00:07,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:07,118 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 02:00:07,223 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2018-11-23 02:00:07,223 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 02:00:07,442 INFO L415 sIntCurrentIteration]: We unified 49 AI predicates to 49 [2018-11-23 02:00:07,442 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 02:00:07,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:00:07,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [5] total 24 [2018-11-23 02:00:07,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:00:07,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 02:00:07,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 02:00:07,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:00:07,444 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 21 states. [2018-11-23 02:00:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:00:08,804 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2018-11-23 02:00:08,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 02:00:08,804 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-11-23 02:00:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:00:08,806 INFO L225 Difference]: With dead ends: 116 [2018-11-23 02:00:08,806 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 02:00:08,806 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-11-23 02:00:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 02:00:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-11-23 02:00:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 02:00:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-23 02:00:08,817 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2018-11-23 02:00:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:00:08,817 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-23 02:00:08,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 02:00:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-23 02:00:08,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 02:00:08,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:00:08,819 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:00:08,820 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:00:08,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:08,821 INFO L82 PathProgramCache]: Analyzing trace with hash -275154794, now seen corresponding path program 1 times [2018-11-23 02:00:08,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:00:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:08,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:00:08,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:00:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:00:09,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:00:09,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:00:09,711 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-11-23 02:00:09,711 INFO L202 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [40], [43], [50], [52], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [97], [98], [104], [105], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-11-23 02:00:09,713 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:00:09,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:00:09,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:00:09,801 INFO L272 AbstractInterpreter]: Visited 47 different actions 127 times. Merged at 22 different actions 37 times. Never widened. Performed 1120 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1120 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 31 variables. [2018-11-23 02:00:09,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:00:09,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:00:09,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:00:09,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:00:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:00:09,814 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:00:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:00:09,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:00:09,894 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-11-23 02:00:09,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:09,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:09,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 02:00:10,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:00:10,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:00:10,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-23 02:00:10,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 02:00:10,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:00:10,078 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-11-23 02:00:10,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-23 02:00:10,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 02:00:10,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-23 02:00:10,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,136 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-11-23 02:00:10,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-23 02:00:10,244 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 0 case distinctions, treesize of input 71 treesize of output 48 [2018-11-23 02:00:10,249 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 20 treesize of output 25 [2018-11-23 02:00:10,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,262 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 50 treesize of output 40 [2018-11-23 02:00:10,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:00:10,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-11-23 02:00:10,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,300 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-11-23 02:00:10,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2018-11-23 02:00: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, 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-11-23 02:00:10,545 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-11-23 02:00:10,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 02:00:10,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-23 02:00:10,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:00:10,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:00:10,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:00:10,606 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 45 treesize of output 57 [2018-11-23 02:00:10,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:10,618 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-11-23 02:00:10,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:52 [2018-11-23 02:00:11,141 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ dll_circular_update_at_~head.offset 8) dll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2018-11-23 02:00:11,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-23 02:00:11,153 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-11-23 02:00:11,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:00:11,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-23 02:00:11,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:00:11,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-23 02:00:11,172 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:00:11,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 7 treesize of output 1 [2018-11-23 02:00:11,180 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:00:11,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,191 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:73, output treesize:16 [2018-11-23 02:00:11,481 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 37 treesize of output 37 [2018-11-23 02:00:11,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 02:00:11,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:00:11,492 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,501 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:00:11,501 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 29 treesize of output 10 [2018-11-23 02:00:11,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:00:11,510 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:43, output treesize:10 [2018-11-23 02:00:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 02:00:11,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:00:13,963 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 02:00:13,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:00:14,159 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:00:14,165 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:00:45,700 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 71 [2018-11-23 02:00:45,704 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:00:45,710 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:01:02,772 WARN L180 SmtUtils]: Spent 3.99 s on a formula simplification that was a NOOP. DAG size: 75 [2018-11-23 02:01:02,776 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:01:04,786 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 Int) (v_subst_2 Int) (dll_circular_update_at_~data Int)) (or (<= v_prenex_4 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (+ v_subst_2 8) dll_circular_update_at_~data))) |c_dll_circular_update_at_#in~head.base|) (+ |c_dll_circular_update_at_#in~head.offset| 8))) (exists ((v_prenex_6 Int) (v_prenex_7 Int)) (< (select (select (let ((.cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse1 (store (select |c_old(#memory_int)| .cse1) (+ v_prenex_6 8) v_prenex_7))) |c_dll_circular_update_at_#in~head.base|) (+ |c_dll_circular_update_at_#in~head.offset| 8)) v_prenex_4)) (exists ((v_prenex_5 Int) (v_prenex_8 Int)) (< v_prenex_4 (select (select (let ((.cse2 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse2 (store (select |c_old(#memory_int)| .cse2) (+ v_prenex_5 8) v_prenex_8))) |c_dll_circular_update_at_#in~head.base|) (+ |c_dll_circular_update_at_#in~head.offset| 8)))))) (forall ((v_main_~len~0_BEFORE_CALL_4 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (or (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (< (select (select (let ((.cse3 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse3 (store (select |c_old(#memory_int)| .cse3) (+ v_prenex_2 8) v_prenex_3))) |c_dll_circular_update_at_#in~head.base|) (+ |c_dll_circular_update_at_#in~head.offset| 8)) v_main_~len~0_BEFORE_CALL_4)) (exists ((v_dll_circular_update_at_~head.offset_9 Int) (v_dll_circular_update_at_~data_5 Int)) (< v_main_~len~0_BEFORE_CALL_4 (select (select (let ((.cse4 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse4 (store (select |c_old(#memory_int)| .cse4) (+ v_dll_circular_update_at_~head.offset_9 8) v_dll_circular_update_at_~data_5))) |c_dll_circular_update_at_#in~head.base|) (+ |c_dll_circular_update_at_#in~head.offset| 8)))) (<= (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_#memory_int| .cse5 (store (select |c_#memory_int| .cse5) (+ v_prenex_10 8) v_prenex_9))) |c_dll_circular_update_at_#in~head.base|) (+ |c_dll_circular_update_at_#in~head.offset| 8)) v_main_~len~0_BEFORE_CALL_4)))) is different from false [2018-11-23 02:01:04,834 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 59 [2018-11-23 02:01:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 02:01:04,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:04,863 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-11-23 02:01:04,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 16 treesize of output 3 [2018-11-23 02:01:04,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:04,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:04,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 02:01:04,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:01:04,869 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:04,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:04,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 02:01:04,914 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:04,918 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:04,918 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:04,926 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:04,927 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:04,931 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:04,952 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:04,954 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:04,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-23 02:01:04,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 02:01:04,985 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 02:01:05,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-23 02:01:05,007 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,009 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,011 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-11-23 02:01:05,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 02:01:05,013 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,015 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,025 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 02:01:05,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 02:01:05,049 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:137, output treesize:65 [2018-11-23 02:01:05,454 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 02:01:05,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:05,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:05,488 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 82 treesize of output 73 [2018-11-23 02:01:05,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 02:01:05,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-11-23 02:01:05,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 8 treesize of output 1 [2018-11-23 02:01:05,525 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,531 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,554 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 22 treesize of output 26 [2018-11-23 02:01:05,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-23 02:01:05,562 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 02:01:05,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 17 [2018-11-23 02:01:05,573 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:01:05,582 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,588 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:01:05,605 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 02:01:05,683 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 82 treesize of output 73 [2018-11-23 02:01:05,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 02:01:05,700 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,715 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 33 treesize of output 31 [2018-11-23 02:01:05,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:01:05,717 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,720 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,726 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 22 treesize of output 26 [2018-11-23 02:01:05,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 17 [2018-11-23 02:01:05,728 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:01:05,737 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2018-11-23 02:01:05,747 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-23 02:01:05,751 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:01:05,765 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 02:01:05,871 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,875 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,876 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:05,882 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:05,883 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:05,888 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:05,889 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,893 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,893 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,897 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:05,898 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:05,902 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:05,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 11 xjuncts. [2018-11-23 02:01:05,973 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 8 variables, input treesize:165, output treesize:312 [2018-11-23 02:01:05,974 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-11-23 02:01:07,445 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 56 [2018-11-23 02:01:07,447 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-11-23 02:01:07,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,462 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 55 treesize of output 63 [2018-11-23 02:01:07,465 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-11-23 02:01:07,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-23 02:01:07,486 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,502 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-11-23 02:01:07,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 15 treesize of output 1 [2018-11-23 02:01:07,504 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,505 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,540 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 48 treesize of output 81 [2018-11-23 02:01:07,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-23 02:01:07,549 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,647 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 57 treesize of output 82 [2018-11-23 02:01:07,648 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-11-23 02:01:07,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:07,744 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 39 [2018-11-23 02:01:07,744 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:07,832 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:07,839 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 52 treesize of output 66 [2018-11-23 02:01:07,840 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-23 02:01:07,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-11-23 02:01: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 8 treesize of output 1 [2018-11-23 02:01:07,952 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-11-23 02:01:07,964 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:07,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:07,965 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-11-23 02:01:07,965 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,967 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,971 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:07,972 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:07,973 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 48 treesize of output 48 [2018-11-23 02:01:07,975 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:07,977 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:07,983 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 32 [2018-11-23 02:01:07,985 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:01:07,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-11-23 02:01:08,003 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:08,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:08,004 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 10 [2018-11-23 02:01:08,004 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,005 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,010 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:08,082 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 54 treesize of output 45 [2018-11-23 02:01:08,084 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:08,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:08,090 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 31 treesize of output 54 [2018-11-23 02:01:08,109 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:08,110 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:08,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, 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 17 [2018-11-23 02:01:08,110 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,119 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:08,119 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:08,120 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:08,121 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 16 [2018-11-23 02:01:08,121 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,122 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,124 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,242 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-11-23 02:01:08,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:08,246 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-11-23 02:01:08,246 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,247 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:08,263 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:01:08,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:01:08,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:01:08,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:01:08,291 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 5 variables, input treesize:78, output treesize:9 [2018-11-23 02:01:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-23 02:01:08,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:01:08,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33, 31] total 85 [2018-11-23 02:01:08,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:01:08,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-23 02:01:08,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-23 02:01:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=6534, Unknown=17, NotChecked=326, Total=7140 [2018-11-23 02:01:08,704 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 59 states. [2018-11-23 02:01:12,847 WARN L180 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-11-23 02:01:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:17,661 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2018-11-23 02:01:17,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 02:01:17,661 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-11-23 02:01:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:17,663 INFO L225 Difference]: With dead ends: 143 [2018-11-23 02:01:17,663 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 02:01:17,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 119 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2831 ImplicationChecksByTransitivity, 64.6s TimeCoverageRelationStatistics Valid=713, Invalid=13309, Unknown=28, NotChecked=470, Total=14520 [2018-11-23 02:01:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 02:01:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2018-11-23 02:01:17,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 02:01:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2018-11-23 02:01:17,680 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 59 [2018-11-23 02:01:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:17,681 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2018-11-23 02:01:17,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-23 02:01:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2018-11-23 02:01:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 02:01:17,682 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:17,682 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:17,682 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:17,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:17,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1847787891, now seen corresponding path program 1 times [2018-11-23 02:01:17,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:01:17,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:17,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:17,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:17,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:01:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:01:17,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:17,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:01:17,745 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 61 with the following transitions: [2018-11-23 02:01:17,745 INFO L202 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [40], [43], [50], [52], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [93], [97], [98], [104], [105], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-11-23 02:01:17,746 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:01:17,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:01:17,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:01:17,807 INFO L272 AbstractInterpreter]: Visited 48 different actions 129 times. Merged at 22 different actions 37 times. Never widened. Performed 1134 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1134 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 31 variables. [2018-11-23 02:01:17,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:17,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:01:17,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:17,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:17,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:01:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:17,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:17,878 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:01:17,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:01:17,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:01:17,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-11-23 02:01:17,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:01:17,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:01:17,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:01:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:17,943 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand 5 states. [2018-11-23 02:01:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:17,971 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2018-11-23 02:01:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:01:17,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-11-23 02:01:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:17,972 INFO L225 Difference]: With dead ends: 139 [2018-11-23 02:01:17,972 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 02:01:17,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:17,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 02:01:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 105. [2018-11-23 02:01:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 02:01:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2018-11-23 02:01:17,993 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 60 [2018-11-23 02:01:17,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:17,993 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2018-11-23 02:01:17,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:01:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2018-11-23 02:01:17,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 02:01:17,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:17,997 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:17,997 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:17,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash 528807664, now seen corresponding path program 2 times [2018-11-23 02:01:17,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:01:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:17,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:17,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:17,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:01:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:18,054 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 02:01:18,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:18,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:01:18,054 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:01:18,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:01:18,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:18,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:18,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:01:18,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:01:18,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:01:18,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:01:18,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:01:18,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:01:18,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:01:18,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-23 02:01:18,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:01:18,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:01:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:01:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:01:18,332 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand 8 states. [2018-11-23 02:01:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:18,406 INFO L93 Difference]: Finished difference Result 168 states and 205 transitions. [2018-11-23 02:01:18,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:01:18,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-23 02:01:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:18,408 INFO L225 Difference]: With dead ends: 168 [2018-11-23 02:01:18,408 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 02:01:18,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:01:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 02:01:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-11-23 02:01:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 02:01:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2018-11-23 02:01:18,425 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 60 [2018-11-23 02:01:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:18,426 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2018-11-23 02:01:18,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:01:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2018-11-23 02:01:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 02:01:18,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:18,427 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:18,427 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:18,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:18,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1960033564, now seen corresponding path program 3 times [2018-11-23 02:01:18,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:01:18,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:18,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:01:18,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:18,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:01:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 02:01:18,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:18,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:01:18,468 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:01:18,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:01:18,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:18,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:18,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:01:18,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:01:18,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:01:18,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:01:18,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 02:01:18,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 02:01:18,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:01:18,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 02:01:18,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:01:18,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:01:18,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:01:18,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:18,649 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 8 states. [2018-11-23 02:01:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:18,741 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2018-11-23 02:01:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:01:18,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-23 02:01:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:18,743 INFO L225 Difference]: With dead ends: 153 [2018-11-23 02:01:18,743 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 02:01:18,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 114 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:01:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 02:01:18,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2018-11-23 02:01:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 02:01:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2018-11-23 02:01:18,759 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 60 [2018-11-23 02:01:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:18,759 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2018-11-23 02:01:18,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:01:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2018-11-23 02:01:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 02:01:18,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:18,760 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-23 02:01:18,760 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:18,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1986554784, now seen corresponding path program 4 times [2018-11-23 02:01:18,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:01:18,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:18,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:01:18,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:18,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:01:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 02:01:18,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:18,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:01:18,815 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:01:18,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:01:18,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:18,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:18,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:18,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:01:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:18,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 02:01:18,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 02:01:18,963 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:01:18,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2018-11-23 02:01:18,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:01:18,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:01:18,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:01:18,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:01:18,964 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand 6 states. [2018-11-23 02:01:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:18,993 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2018-11-23 02:01:18,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:01:18,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-23 02:01:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:18,994 INFO L225 Difference]: With dead ends: 171 [2018-11-23 02:01:18,994 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 02:01:18,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:01:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 02:01:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-23 02:01:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 02:01:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2018-11-23 02:01:19,005 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 67 [2018-11-23 02:01:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:19,005 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2018-11-23 02:01:19,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:01:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-23 02:01:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 02:01:19,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:19,006 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:19,006 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:19,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash -658703423, now seen corresponding path program 1 times [2018-11-23 02:01:19,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:01:19,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:19,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:01:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:01:19,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:19,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:01:19,047 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-11-23 02:01:19,047 INFO L202 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [32], [34], [40], [43], [50], [52], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [97], [98], [104], [105], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-11-23 02:01:19,048 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:01:19,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:01:19,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:01:19,115 INFO L272 AbstractInterpreter]: Visited 49 different actions 145 times. Merged at 24 different actions 42 times. Never widened. Performed 1268 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1268 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 6 different actions. Largest state had 31 variables. [2018-11-23 02:01:19,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:19,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:01:19,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:19,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:19,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:19,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:01:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:19,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:01:19,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:01:19,235 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:01:19,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-11-23 02:01:19,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:01:19,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:01:19,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:01:19,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:19,236 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 6 states. [2018-11-23 02:01:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:19,278 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2018-11-23 02:01:19,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:01:19,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 02:01:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:19,280 INFO L225 Difference]: With dead ends: 101 [2018-11-23 02:01:19,280 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 02:01:19,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 02:01:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-11-23 02:01:19,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 02:01:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-11-23 02:01:19,293 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 69 [2018-11-23 02:01:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:19,294 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-11-23 02:01:19,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:01:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-11-23 02:01:19,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 02:01:19,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:19,294 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:19,295 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:19,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:19,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2010122590, now seen corresponding path program 5 times [2018-11-23 02:01:19,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:01:19,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:19,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:01:19,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 02:01:19,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:19,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:01:19,339 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:01:19,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:01:19,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:19,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:19,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:01:19,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:01:19,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 02:01:19,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:01:19,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 02:01:19,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 02:01:19,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:01:19,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2018-11-23 02:01:19,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:01:19,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:01:19,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:01:19,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:19,501 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 6 states. [2018-11-23 02:01:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:19,525 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2018-11-23 02:01:19,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:01:19,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 02:01:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:19,526 INFO L225 Difference]: With dead ends: 108 [2018-11-23 02:01:19,526 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 02:01:19,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:01:19,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 02:01:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 02:01:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 02:01:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-11-23 02:01:19,536 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 69 [2018-11-23 02:01:19,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:19,536 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-11-23 02:01:19,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:01:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-11-23 02:01:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 02:01:19,537 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:19,537 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:19,537 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:19,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash -852893502, now seen corresponding path program 1 times [2018-11-23 02:01:19,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:01:19,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:01:19,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:01:19,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:01:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 02:01:20,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:20,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:01:20,302 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-23 02:01:20,302 INFO L202 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [25], [27], [30], [32], [34], [40], [43], [50], [52], [56], [57], [58], [60], [67], [69], [71], [74], [78], [82], [83], [84], [91], [93], [97], [98], [104], [105], [130], [136], [138], [139], [140], [141], [142], [143], [144], [145], [148], [149], [150], [151], [152], [153], [154] [2018-11-23 02:01:20,303 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:01:20,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:01:20,422 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:01:20,422 INFO L272 AbstractInterpreter]: Visited 50 different actions 200 times. Merged at 28 different actions 78 times. Widened at 2 different actions 2 times. Performed 1602 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1602 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 8 different actions. Largest state had 31 variables. [2018-11-23 02:01:20,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:20,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:01:20,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:20,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:20,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:20,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:01:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:20,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:20,517 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-11-23 02:01:20,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 02:01:20,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:20,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:20,657 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-11-23 02:01:20,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 02:01:20,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:01:20,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-23 02:01:20,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-23 02:01:20,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, 1 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-11-23 02:01:20,732 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-11-23 02:01:20,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,739 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-11-23 02:01:20,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-11-23 02:01:20,820 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 0 case distinctions, treesize of input 71 treesize of output 48 [2018-11-23 02:01:20,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 25 [2018-11-23 02:01:20,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,845 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 50 treesize of output 40 [2018-11-23 02:01:20,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:20,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-11-23 02:01:20,850 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:20,873 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-11-23 02:01:20,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:71, output treesize:46 [2018-11-23 02:01:21,068 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 19 treesize of output 16 [2018-11-23 02:01:21,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-11-23 02:01:21,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,075 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-11-23 02:01:21,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-11-23 02:01:21,533 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2018-11-23 02:01:21,540 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 54 treesize of output 48 [2018-11-23 02:01:21,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:21,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:21,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:21,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-11-23 02:01:21,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,558 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-11-23 02:01:21,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:43 [2018-11-23 02:01:21,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-11-23 02:01:21,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 02:01:21,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2018-11-23 02:01:21,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 118 [2018-11-23 02:01:21,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, 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 1 [2018-11-23 02:01:21,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:21,856 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 112 treesize of output 104 [2018-11-23 02:01:21,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 61 [2018-11-23 02:01:21,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 02:01:21,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:01:21,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:21,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:142 [2018-11-23 02:01:22,648 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 128 treesize of output 114 [2018-11-23 02:01:22,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:22,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 104 [2018-11-23 02:01:22,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:22,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:22,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 87 [2018-11-23 02:01:22,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:22,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:22,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:22,757 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 106 treesize of output 120 [2018-11-23 02:01:22,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 8 xjuncts. [2018-11-23 02:01:22,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 9 xjuncts. [2018-11-23 02:01:23,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 76 [2018-11-23 02:01:23,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-11-23 02:01:23,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-11-23 02:01:23,072 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-11-23 02:01:23,093 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,112 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:23,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 82 [2018-11-23 02:01:23,122 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-11-23 02:01:23,123 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,161 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 78 treesize of output 72 [2018-11-23 02:01:23,161 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,187 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 72 treesize of output 68 [2018-11-23 02:01:23,188 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,211 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:23,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2018-11-23 02:01:23,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-11-23 02:01:23,219 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-11-23 02:01:23,248 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-11-23 02:01:23,279 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:23,309 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 02:01:23,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 78 treesize of output 68 [2018-11-23 02:01:23,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 28 [2018-11-23 02:01:23,314 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11-23 02:01:23,330 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,340 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2018-11-23 02:01:23,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-11-23 02:01:23,348 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 64 [2018-11-23 02:01:23,382 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-11-23 02:01:23,408 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:23,437 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 02:01:23,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 82 [2018-11-23 02:01:23,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-11-23 02:01:23,446 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,471 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 72 treesize of output 68 [2018-11-23 02:01:23,472 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-11-23 02:01:23,497 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,520 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:23,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2018-11-23 02:01:23,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-11-23 02:01:23,532 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2018-11-23 02:01:23,557 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2018-11-23 02:01:23,587 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:23,625 INFO L267 ElimStorePlain]: Start of recursive call 29: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 02:01:23,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 84 [2018-11-23 02:01:23,636 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 80 treesize of output 74 [2018-11-23 02:01:23,637 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,665 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 74 treesize of output 70 [2018-11-23 02:01:23,665 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,694 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2018-11-23 02:01:23,695 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:23,728 INFO L267 ElimStorePlain]: Start of recursive call 33: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-23 02:01:23,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 [2018-11-23 02:01:23,736 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2018-11-23 02:01:23,737 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2018-11-23 02:01:23,766 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2018-11-23 02:01:23,794 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:23,820 INFO L267 ElimStorePlain]: Start of recursive call 37: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-23 02:01:24,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-11-23 02:01:24,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2018-11-23 02:01:24,197 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,203 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-23 02:01:24,206 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-11-23 02:01:24,207 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,213 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-11-23 02:01:24,216 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,217 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 36 treesize of output 7 [2018-11-23 02:01:24,217 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,223 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-23 02:01:24,228 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-11-23 02:01:24,228 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,233 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-23 02:01:24,236 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,237 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 36 treesize of output 7 [2018-11-23 02:01:24,237 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,243 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-23 02:01:24,246 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,247 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 36 treesize of output 7 [2018-11-23 02:01:24,247 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,251 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-11-23 02:01:24,255 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-11-23 02:01:24,255 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,261 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-23 02:01:24,265 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,265 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 36 treesize of output 7 [2018-11-23 02:01:24,266 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,271 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-11-23 02:01:24,274 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,275 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 36 treesize of output 7 [2018-11-23 02:01:24,275 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,279 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-23 02:01:24,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-11-23 02:01:24,282 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,286 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-11-23 02:01:24,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-11-23 02:01:24,289 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,293 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-23 02:01:24,297 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,297 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 36 treesize of output 7 [2018-11-23 02:01:24,297 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,303 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-11-23 02:01:24,307 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,307 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 36 treesize of output 7 [2018-11-23 02:01:24,307 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,312 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-11-23 02:01:24,316 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-11-23 02:01:24,316 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,322 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-23 02:01:24,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 22 treesize of output 7 [2018-11-23 02:01:24,325 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,328 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 56 [2018-11-23 02:01:24,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-23 02:01:24,336 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 23 [2018-11-23 02:01:24,353 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,369 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2018-11-23 02:01:24,370 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,378 INFO L267 ElimStorePlain]: Start of recursive call 71: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-11-23 02:01:24,382 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 7 [2018-11-23 02:01:24,382 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,388 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 72 [2018-11-23 02:01:24,396 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,397 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 64 treesize of output 35 [2018-11-23 02:01:24,397 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,426 INFO L267 ElimStorePlain]: Start of recursive call 77: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-23 02:01:24,430 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,430 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 36 treesize of output 7 [2018-11-23 02:01:24,430 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,436 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-23 02:01:24,439 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,439 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 36 treesize of output 7 [2018-11-23 02:01:24,440 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,445 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-11-23 02:01:24,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 49 [2018-11-23 02:01:24,453 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,478 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:01:24,479 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 60 treesize of output 31 [2018-11-23 02:01:24,479 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,498 INFO L267 ElimStorePlain]: Start of recursive call 83: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:24,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:01:24,581 INFO L202 ElimStorePlain]: Needed 85 recursive calls to eliminate 7 variables, input treesize:131, output treesize:21 [2018-11-23 02:01:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-23 02:01:24,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:25,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,138 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,145 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,150 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-11-23 02:01:25,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 5 [2018-11-23 02:01:25,253 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,257 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,258 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 115 treesize of output 109 [2018-11-23 02:01:25,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 5 [2018-11-23 02:01:25,260 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,264 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,265 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 87 treesize of output 81 [2018-11-23 02:01:25,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 5 [2018-11-23 02:01:25,267 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,270 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,326 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,332 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,333 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,339 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,340 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,346 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,386 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 115 treesize of output 109 [2018-11-23 02:01:25,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 5 [2018-11-23 02:01:25,388 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,391 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 87 [2018-11-23 02:01:25,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 35 treesize of output 5 [2018-11-23 02:01:25,395 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,398 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,429 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,430 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,430 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,432 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,432 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,434 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,459 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,461 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,462 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,465 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,466 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,468 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-11-23 02:01:25,482 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 6 variables, input treesize:245, output treesize:178 [2018-11-23 02:01:25,748 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 101 treesize of output 95 [2018-11-23 02:01:25,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 02:01:25,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2018-11-23 02:01:25,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 13 treesize of output 5 [2018-11-23 02:01:25,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,772 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,775 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 99 treesize of output 93 [2018-11-23 02:01:25,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 13 treesize of output 5 [2018-11-23 02:01:25,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,790 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,886 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,891 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,892 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,897 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,903 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,970 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,973 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,974 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,977 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:25,978 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:25,982 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:26,038 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,045 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,046 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,054 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,055 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,065 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,114 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,120 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,121 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,129 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,130 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,136 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:26,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 75 [2018-11-23 02:01:26,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 5 [2018-11-23 02:01:26,195 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:26,199 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:26,201 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 91 treesize of output 75 [2018-11-23 02:01:26,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 5 [2018-11-23 02:01:26,203 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:26,206 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:26,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-23 02:01:26,238 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 6 variables, input treesize:209, output treesize:325 [2018-11-23 02:01:26,238 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 02:01:27,059 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 79 [2018-11-23 02:01:27,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,110 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 69 treesize of output 66 [2018-11-23 02:01:27,111 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 17 treesize of output 1 [2018-11-23 02:01:27,112 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,149 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:27,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:27,180 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 27 treesize of output 24 [2018-11-23 02:01:27,181 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 17 treesize of output 1 [2018-11-23 02:01:27,182 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,184 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-23 02:01:27,203 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 14 treesize of output 5 [2018-11-23 02:01:27,203 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,207 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,238 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,242 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,266 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,269 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 9 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:01:27,280 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 13 variables, input treesize:172, output treesize:24 [2018-11-23 02:01:27,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:27,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:27,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:27,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:27,583 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 93 treesize of output 65 [2018-11-23 02:01:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 02:01:27,602 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,619 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 46 treesize of output 48 [2018-11-23 02:01:27,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 35 [2018-11-23 02:01:27,622 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,647 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 35 treesize of output 27 [2018-11-23 02:01:27,648 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:27,675 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 40 treesize of output 36 [2018-11-23 02:01:27,675 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 02:01:27,699 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:01:27,723 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:01:27,954 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:01:27,955 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 02:01:27,957 INFO L168 Benchmark]: Toolchain (without parser) took 82460.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.4 MB). Free memory was 955.3 MB in the beginning and 972.4 MB in the end (delta: -17.0 MB). Peak memory consumption was 368.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:01:27,958 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:01:27,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:01:27,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.61 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-11-23 02:01:27,958 INFO L168 Benchmark]: Boogie Preprocessor took 31.64 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:01:27,959 INFO L168 Benchmark]: RCFGBuilder took 344.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:01:27,959 INFO L168 Benchmark]: TraceAbstraction took 81705.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 972.4 MB in the end (delta: 124.6 MB). Peak memory consumption was 360.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:01:27,960 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.64 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 344.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 81705.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 235.9 MB). Free memory was 1.1 GB in the beginning and 972.4 MB in the end (delta: 124.6 MB). Peak memory consumption was 360.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:01:29,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:01:29,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:01:29,341 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:01:29,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:01:29,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:01:29,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:01:29,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:01:29,345 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:01:29,346 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:01:29,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:01:29,347 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:01:29,348 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:01:29,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:01:29,349 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:01:29,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:01:29,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:01:29,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:01:29,353 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:01:29,355 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:01:29,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:01:29,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:01:29,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:01:29,358 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:01:29,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:01:29,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:01:29,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:01:29,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:01:29,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:01:29,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:01:29,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:01:29,363 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:01:29,363 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:01:29,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:01:29,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:01:29,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:01:29,365 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 02:01:29,376 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:01:29,376 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:01:29,376 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:01:29,376 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:01:29,377 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:01:29,377 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:01:29,377 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:01:29,377 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:01:29,377 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:01:29,377 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:01:29,378 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:01:29,378 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:01:29,378 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:01:29,378 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:01:29,379 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:01:29,379 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:01:29,379 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:01:29,379 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:01:29,379 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:01:29,380 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:01:29,380 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:01:29,380 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:01:29,380 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:01:29,380 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:01:29,380 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:01:29,380 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:01:29,381 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:01:29,381 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:01:29,381 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:01:29,381 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:01:29,381 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:01:29,381 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 02:01:29,381 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:01:29,382 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:01:29,382 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:01:29,382 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_436407e3-2cdf-40ef-b557-ea256fec49c1/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 ! call(__VERIFIER_error())) ) 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 -> a072faa67a1e34154107ea3f600c480af03b38c6 [2018-11-23 02:01:29,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:01:29,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:01:29,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:01:29,425 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:01:29,425 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:01:29,425 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 02:01:29,468 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data/1849d12dd/5c1d2277c72a474e806d9506ae85d6f4/FLAGc637ef643 [2018-11-23 02:01:29,809 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:01:29,810 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/sv-benchmarks/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 02:01:29,818 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data/1849d12dd/5c1d2277c72a474e806d9506ae85d6f4/FLAGc637ef643 [2018-11-23 02:01:29,826 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/data/1849d12dd/5c1d2277c72a474e806d9506ae85d6f4 [2018-11-23 02:01:29,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:01:29,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:01:29,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:01:29,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:01:29,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:01:29,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:01:29" (1/1) ... [2018-11-23 02:01:29,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20524921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:29, skipping insertion in model container [2018-11-23 02:01:29,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:01:29" (1/1) ... [2018-11-23 02:01:29,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:01:29,871 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:01:30,090 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:01:30,099 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:01:30,187 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:01:30,212 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:01:30,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30 WrapperNode [2018-11-23 02:01:30,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:01:30,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:01:30,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:01:30,213 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:01:30,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:01:30,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:01:30,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:01:30,238 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:01:30,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... [2018-11-23 02:01:30,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:01:30,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:01:30,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:01:30,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:01:30,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:30,295 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2018-11-23 02:01:30,295 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2018-11-23 02:01:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2018-11-23 02:01:30,296 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2018-11-23 02:01:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:01:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 02:01:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2018-11-23 02:01:30,296 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2018-11-23 02:01:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 02:01:30,296 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 02:01:30,296 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 02:01:30,297 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 02:01:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:01:30,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:01:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:01:30,297 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:01:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 02:01:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 02:01:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2018-11-23 02:01:30,297 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2018-11-23 02:01:30,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:01:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 02:01:30,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:01:30,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:01:30,609 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:01:30,610 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 02:01:30,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:01:30 BoogieIcfgContainer [2018-11-23 02:01:30,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:01:30,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:01:30,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:01:30,612 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:01:30,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:01:29" (1/3) ... [2018-11-23 02:01:30,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d251818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:01:30, skipping insertion in model container [2018-11-23 02:01:30,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:01:30" (2/3) ... [2018-11-23 02:01:30,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d251818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:01:30, skipping insertion in model container [2018-11-23 02:01:30,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:01:30" (3/3) ... [2018-11-23 02:01:30,615 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 02:01:30,620 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:01:30,625 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:01:30,634 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:01:30,655 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:01:30,656 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:01:30,656 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:01:30,656 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:01:30,656 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:01:30,656 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:01:30,656 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:01:30,656 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:01:30,656 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:01:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-23 02:01:30,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 02:01:30,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:30,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:30,673 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:30,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1202603355, now seen corresponding path program 1 times [2018-11-23 02:01:30,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:01:30,679 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:01:30,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:30,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:01:30,815 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:01:30,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:30,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:01:30,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:01:30,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:01:30,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:01:30,838 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 5 states. [2018-11-23 02:01:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:30,902 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2018-11-23 02:01:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:01:30,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 02:01:30,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:30,909 INFO L225 Difference]: With dead ends: 103 [2018-11-23 02:01:30,909 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 02:01:30,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-11-23 02:01:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 02:01:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-23 02:01:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 02:01:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-23 02:01:30,947 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 31 [2018-11-23 02:01:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:30,948 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-23 02:01:30,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:01:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 02:01:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 02:01:30,950 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:30,950 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:30,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:30,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:30,950 INFO L82 PathProgramCache]: Analyzing trace with hash -745395055, now seen corresponding path program 1 times [2018-11-23 02:01:30,951 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:01:30,951 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:01:30,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:31,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:01:31,087 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:01:31,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:01:31,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 02:01:31,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:01:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:01:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:01:31,092 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2018-11-23 02:01:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:31,146 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2018-11-23 02:01:31,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:01:31,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 02:01:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:31,148 INFO L225 Difference]: With dead ends: 66 [2018-11-23 02:01:31,148 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 02:01:31,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 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-11-23 02:01:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 02:01:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-23 02:01:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:01:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-11-23 02:01:31,156 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-11-23 02:01:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:31,156 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-11-23 02:01:31,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:01:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-11-23 02:01:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 02:01:31,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:31,159 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-23 02:01:31,159 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:31,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash -558481625, now seen corresponding path program 1 times [2018-11-23 02:01:31,159 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:01:31,159 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:01:31,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:31,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:01:31,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:01:31,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:31,356 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:31,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:31,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:31,589 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-11-23 02:01:31,591 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-11-23 02:01:31,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:31,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:31,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:31,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-23 02:01:31,960 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 29 treesize of output 29 [2018-11-23 02:01:31,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-23 02:01:31,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:31,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 9 [2018-11-23 02:01:31,980 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:31,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:31,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:31,993 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-11-23 02:01:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 02:01:32,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:32,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-23 02:01:32,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-23 02:01:32,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:32,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:32,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:01:32,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2018-11-23 02:01:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 02:01:32,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 02:01:32,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 21, 12] total 34 [2018-11-23 02:01:32,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 02:01:32,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 02:01:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 02:01:32,663 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 34 states. [2018-11-23 02:01:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:36,134 INFO L93 Difference]: Finished difference Result 95 states and 120 transitions. [2018-11-23 02:01:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 02:01:36,134 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 49 [2018-11-23 02:01:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:36,136 INFO L225 Difference]: With dead ends: 95 [2018-11-23 02:01:36,136 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 02:01:36,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=211, Invalid=1951, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 02:01:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 02:01:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2018-11-23 02:01:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 02:01:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-11-23 02:01:36,144 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2018-11-23 02:01:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:36,145 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-11-23 02:01:36,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 02:01:36,145 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-11-23 02:01:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 02:01:36,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:36,146 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:36,146 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:36,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash 901864381, now seen corresponding path program 2 times [2018-11-23 02:01:36,147 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:01:36,147 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:01:36,159 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 02:01:36,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:01:36,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:01:36,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:36,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:01:36,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:01:36,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:36,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:36,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:01:37,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:01:37,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:01:37,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:37,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:01:37,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:01:37,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 02:01:37,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-11-23 02:01:37,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:01:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:01:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:01:37,277 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 9 states. [2018-11-23 02:01:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:01:37,413 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2018-11-23 02:01:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:01:37,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-11-23 02:01:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:01:37,414 INFO L225 Difference]: With dead ends: 94 [2018-11-23 02:01:37,415 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 02:01:37,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:01:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 02:01:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2018-11-23 02:01:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 02:01:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-23 02:01:37,422 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 57 [2018-11-23 02:01:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:01:37,423 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-23 02:01:37,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:01:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 02:01:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 02:01:37,424 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:01:37,424 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:01:37,424 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:01:37,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:01:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1666248678, now seen corresponding path program 1 times [2018-11-23 02:01:37,425 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:01:37,425 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:01:37,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:01:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:37,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:37,586 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-11-23 02:01:37,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 02:01:37,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:37,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:37,651 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-11-23 02:01:37,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 02:01:37,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:01:37,680 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-11-23 02:01:37,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 02:01:37,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 02:01:37,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, 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-11-23 02:01:37,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,778 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-11-23 02:01:37,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 02:01:37,887 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 0 case distinctions, treesize of input 71 treesize of output 48 [2018-11-23 02:01:37,895 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 20 treesize of output 25 [2018-11-23 02:01:37,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,926 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 50 treesize of output 40 [2018-11-23 02:01:37,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:37,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-11-23 02:01:37,934 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:37,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:38,004 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-11-23 02:01:38,005 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:49 [2018-11-23 02:01:38,331 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-11-23 02:01:38,333 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-11-23 02:01:38,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:38,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:38,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:38,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 02:01:38,433 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 52 treesize of output 44 [2018-11-23 02:01:38,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:38,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:38,443 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 41 treesize of output 45 [2018-11-23 02:01:38,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:38,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:38,470 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-11-23 02:01:38,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2018-11-23 02:01:40,248 WARN L854 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data (_ BitVec 32)) (dll_circular_update_at_~head.offset (_ BitVec 32))) (= |c_#memory_int| (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (bvadd dll_circular_update_at_~head.offset (_ bv8 32)) dll_circular_update_at_~data))))) is different from true [2018-11-23 02:01:40,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:40,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-11-23 02:01:40,275 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 0 case distinctions, treesize of input 37 treesize of output 32 [2018-11-23 02:01:40,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:40,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:01:40,296 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:40,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:40,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 02:01:40,335 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-11-23 02:01:40,335 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:40,343 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:40,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:40,357 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:71, output treesize:18 [2018-11-23 02:01: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 29 treesize of output 29 [2018-11-23 02:01:42,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 02:01:42,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:42,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:42,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:42,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 02:01:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 02:01:42,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:45,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:01:45,585 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:01:45,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:01:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:01:45,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:01:45,639 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-11-23 02:01:45,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 02:01:45,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:45,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:45,647 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-11-23 02:01:45,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 02:01:45,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:01:45,663 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-11-23 02:01:45,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 02:01:45,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-23 02:01:45,698 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-11-23 02:01:45,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,716 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-11-23 02:01:45,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-11-23 02:01:45,761 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 0 case distinctions, treesize of input 71 treesize of output 48 [2018-11-23 02:01:45,767 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 20 treesize of output 25 [2018-11-23 02:01:45,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,795 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 50 treesize of output 40 [2018-11-23 02:01:45,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:45,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2018-11-23 02:01:45,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,839 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-11-23 02:01:45,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:74, output treesize:49 [2018-11-23 02:01:45,852 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-11-23 02:01:45,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 02:01:45,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 02:01:45,886 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 52 treesize of output 44 [2018-11-23 02:01:45,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:45,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:45,896 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 41 treesize of output 45 [2018-11-23 02:01:45,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,924 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-11-23 02:01:45,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:50 [2018-11-23 02:01:45,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:45,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-23 02:01:45,952 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-11-23 02:01:45,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:45,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:01:45,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-23 02:01:45,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:01:45,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:46,019 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 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-23 02:01:46,020 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:46,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:01:46,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:46,047 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:71, output treesize:18 [2018-11-23 02:01:48,131 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 29 treesize of output 29 [2018-11-23 02:01:48,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-23 02:01:48,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:48,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 02:01:48,153 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:01:48,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:48,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:01:48,163 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 02:01:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 02:01:48,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:01:50,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:01:50,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-23 02:01:50,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 02:01:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 02:01:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1378, Unknown=3, NotChecked=74, Total=1560 [2018-11-23 02:01:50,604 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 33 states. [2018-11-23 02:02:20,909 WARN L180 SmtUtils]: Spent 1.74 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 02:02:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:25,897 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2018-11-23 02:02:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 02:02:25,897 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 58 [2018-11-23 02:02:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:25,898 INFO L225 Difference]: With dead ends: 111 [2018-11-23 02:02:25,898 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 02:02:25,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 35.9s TimeCoverageRelationStatistics Valid=275, Invalid=3374, Unknown=15, NotChecked=118, Total=3782 [2018-11-23 02:02:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 02:02:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2018-11-23 02:02:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 02:02:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 117 transitions. [2018-11-23 02:02:25,913 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 117 transitions. Word has length 58 [2018-11-23 02:02:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:25,913 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 117 transitions. [2018-11-23 02:02:25,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 02:02:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 117 transitions. [2018-11-23 02:02:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 02:02:25,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:25,915 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:25,915 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:25,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1784713116, now seen corresponding path program 1 times [2018-11-23 02:02:25,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:02:25,916 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:02:25,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:25,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 02:02:25,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 02:02:26,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:02:26,064 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:02:26,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:26,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 02:02:26,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 02:02:26,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 02:02:26,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 6 [2018-11-23 02:02:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:02:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:02:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:02:26,173 INFO L87 Difference]: Start difference. First operand 95 states and 117 transitions. Second operand 6 states. [2018-11-23 02:02:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:26,308 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2018-11-23 02:02:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:02:26,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-11-23 02:02:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:26,310 INFO L225 Difference]: With dead ends: 143 [2018-11-23 02:02:26,310 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 02:02:26,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:02:26,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 02:02:26,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-23 02:02:26,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 02:02:26,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-11-23 02:02:26,321 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 58 [2018-11-23 02:02:26,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:26,321 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-11-23 02:02:26,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:02:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-11-23 02:02:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 02:02:26,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:26,323 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:26,323 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:26,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:26,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1486917536, now seen corresponding path program 1 times [2018-11-23 02:02:26,323 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:02:26,323 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:02:26,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:26,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:26,421 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:02:26,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 02:02:26,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:02:26,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-11-23 02:02:26,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 02:02:26,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 02:02:26,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:02:26,458 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 7 states. [2018-11-23 02:02:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:26,499 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2018-11-23 02:02:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:02:26,499 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-11-23 02:02:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:26,501 INFO L225 Difference]: With dead ends: 130 [2018-11-23 02:02:26,501 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 02:02:26,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:02:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 02:02:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2018-11-23 02:02:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 02:02:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2018-11-23 02:02:26,516 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 59 [2018-11-23 02:02:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:26,516 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2018-11-23 02:02:26,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 02:02:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-11-23 02:02:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 02:02:26,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:26,517 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:26,517 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:26,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:26,518 INFO L82 PathProgramCache]: Analyzing trace with hash 326625117, now seen corresponding path program 2 times [2018-11-23 02:02:26,518 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:02:26,518 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:02:26,541 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 02:02:26,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:02:26,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:02:26,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:02:26,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:02:26,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:02:26,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:02:26,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:02:27,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:02:27,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:02:27,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:02:27,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 02:02:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 02:02:28,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 02:02:28,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 02:02:28,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:02:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:02:28,044 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 18 states. [2018-11-23 02:02:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:28,943 INFO L93 Difference]: Finished difference Result 185 states and 242 transitions. [2018-11-23 02:02:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:02:28,943 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-11-23 02:02:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:28,945 INFO L225 Difference]: With dead ends: 185 [2018-11-23 02:02:28,945 INFO L226 Difference]: Without dead ends: 151 [2018-11-23 02:02:28,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-23 02:02:28,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-23 02:02:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 112. [2018-11-23 02:02:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 02:02:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 143 transitions. [2018-11-23 02:02:28,963 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 143 transitions. Word has length 59 [2018-11-23 02:02:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:28,964 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 143 transitions. [2018-11-23 02:02:28,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 02:02:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 143 transitions. [2018-11-23 02:02:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 02:02:28,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:28,965 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:28,965 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:28,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1441823274, now seen corresponding path program 1 times [2018-11-23 02:02:28,965 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:02:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:02:28,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:02:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:29,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:29,082 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:02:29,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:02:29,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:02:29,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:02:29,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:02:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:29,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:02:29,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:02:29,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 02:02:29,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-11-23 02:02:29,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:02:29,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:02:29,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:02:29,211 INFO L87 Difference]: Start difference. First operand 112 states and 143 transitions. Second operand 9 states. [2018-11-23 02:02:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:29,331 INFO L93 Difference]: Finished difference Result 162 states and 205 transitions. [2018-11-23 02:02:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:02:29,333 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-23 02:02:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:29,334 INFO L225 Difference]: With dead ends: 162 [2018-11-23 02:02:29,334 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 02:02:29,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 02:02:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 02:02:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2018-11-23 02:02:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 02:02:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2018-11-23 02:02:29,351 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 67 [2018-11-23 02:02:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:29,351 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2018-11-23 02:02:29,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:02:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2018-11-23 02:02:29,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 02:02:29,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:29,352 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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-11-23 02:02:29,352 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:29,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:29,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1554603897, now seen corresponding path program 3 times [2018-11-23 02:02:29,353 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:02:29,353 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:02:29,368 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 02:02:29,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 02:02:29,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:02:29,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 02:02:29,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 02:02:29,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:02:29,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:02:29,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:02:48,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 02:02:48,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:02:48,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 02:02:48,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:02:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 02:02:48,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 02:02:48,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8, 12] total 18 [2018-11-23 02:02:48,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 02:02:48,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:02:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:02:48,435 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand 18 states. [2018-11-23 02:02:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:02:48,547 INFO L93 Difference]: Finished difference Result 175 states and 208 transitions. [2018-11-23 02:02:48,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:02:48,548 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-11-23 02:02:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:02:48,548 INFO L225 Difference]: With dead ends: 175 [2018-11-23 02:02:48,548 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 02:02:48,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 245 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-23 02:02:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 02:02:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2018-11-23 02:02:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 02:02:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-11-23 02:02:48,559 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 67 [2018-11-23 02:02:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:02:48,559 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-23 02:02:48,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 02:02:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-11-23 02:02:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 02:02:48,560 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:02:48,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:02:48,560 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:02:48,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:02:48,560 INFO L82 PathProgramCache]: Analyzing trace with hash -947099760, now seen corresponding path program 1 times [2018-11-23 02:02:48,561 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:02:48,561 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:02:48,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:02:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:02:48,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:02:48,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 6 treesize of output 5 [2018-11-23 02:02:48,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 02:02:48,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:48,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:48,817 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-11-23 02:02:48,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 02:02:48,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:02:48,851 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-11-23 02:02:48,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:02:48,884 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-11-23 02:02:48,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,887 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-11-23 02:02:48,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 02:02:48,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-23 02:02:48,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:48,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 28 [2018-11-23 02:02:49,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 12 treesize of output 11 [2018-11-23 02:02:49,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:44 [2018-11-23 02:02:49,172 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 0 case distinctions, treesize of input 140 treesize of output 111 [2018-11-23 02:02:49,190 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 27 treesize of output 30 [2018-11-23 02:02:49,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:49,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 97 [2018-11-23 02:02:49,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:49,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 118 [2018-11-23 02:02:49,351 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,429 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,583 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:49,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2018-11-23 02:02:49,610 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 20 treesize of output 27 [2018-11-23 02:02:49,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:49,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2018-11-23 02:02:49,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:49,660 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-11-23 02:02:49,660 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,677 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,688 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:49,716 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:143, output treesize:96 [2018-11-23 02:02:50,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:50,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:50,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:50,134 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 95 treesize of output 98 [2018-11-23 02:02:50,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:50,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:50,216 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 121 [2018-11-23 02:02:50,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 02:02:50,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:50,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:50,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-23 02:02:50,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:50,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:50,403 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 48 treesize of output 50 [2018-11-23 02:02:50,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:50,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:50,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:50,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:132, output treesize:94 [2018-11-23 02:02:50,796 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 25 treesize of output 18 [2018-11-23 02:02:50,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 02:02:50,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:50,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:50,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:50,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-11-23 02:02:51,002 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:02:51,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:51,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:51,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:51,028 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 175 treesize of output 201 [2018-11-23 02:02:51,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:51,187 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 135 [2018-11-23 02:02:51,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-23 02:02:51,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 02:02:51,780 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:02:51,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:51,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:51,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:51,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 178 [2018-11-23 02:02:51,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:51,971 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 88 [2018-11-23 02:02:51,973 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:02:52,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:02:52,047 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:02:52,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 147 [2018-11-23 02:02:52,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 51 [2018-11-23 02:02:52,102 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-23 02:02:52,146 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:02:52,151 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:02:52,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 158 [2018-11-23 02:02:52,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 51 [2018-11-23 02:02:52,213 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-23 02:02:52,276 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:02:52,280 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:02:52,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,298 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 191 [2018-11-23 02:02:52,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,386 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 88 [2018-11-23 02:02:52,387 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:02:52,476 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:02:52,480 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:02:52,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,506 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 188 [2018-11-23 02:02:52,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,618 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 88 [2018-11-23 02:02:52,619 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:02:52,708 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:02:52,713 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:02:52,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 153 [2018-11-23 02:02:52,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:52,747 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 47 treesize of output 51 [2018-11-23 02:02:52,747 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:52,777 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:53,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 12 xjuncts. [2018-11-23 02:02:53,510 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 2 variables, input treesize:190, output treesize:1489 [2018-11-23 02:02:54,112 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 48 [2018-11-23 02:02:55,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 217 [2018-11-23 02:02:55,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 213 treesize of output 194 [2018-11-23 02:02:55,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:56,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 171 [2018-11-23 02:02:56,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:56,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:02:56,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:56,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:56,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:56,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:56,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:56,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:56,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:56,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:56,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 194 treesize of output 220 [2018-11-23 02:02:56,926 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 02:02:56,926 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:57,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 167 [2018-11-23 02:02:57,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:57,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2018-11-23 02:02:57,210 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:02:57,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:57,322 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 95 treesize of output 87 [2018-11-23 02:02:57,322 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:57,506 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 151 [2018-11-23 02:02:57,507 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:02:57,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2018-11-23 02:02:57,694 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:02:57,785 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 133 treesize of output 119 [2018-11-23 02:02:57,785 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:57,854 INFO L267 ElimStorePlain]: Start of recursive call 5: 9 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 02:02:58,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:58,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:58,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:58,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:02:58,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 171 treesize of output 189 [2018-11-23 02:02:58,460 INFO L478 Elim1Store]: Elim1 applied some 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 171 treesize of output 179 [2018-11-23 02:02:58,462 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 02:02:58,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, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 123 [2018-11-23 02:02:58,957 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:02:59,366 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 83 treesize of output 67 [2018-11-23 02:02:59,367 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:59,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2018-11-23 02:02:59,498 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:02:59,624 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 106 [2018-11-23 02:02:59,625 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:02:59,975 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 76 treesize of output 60 [2018-11-23 02:02:59,975 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:00,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 50 [2018-11-23 02:03:00,152 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:00,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 89 [2018-11-23 02:03:00,409 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:00,636 INFO L267 ElimStorePlain]: Start of recursive call 13: 17 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 02:03:01,239 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 194 treesize of output 192 [2018-11-23 02:03:01,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 188 treesize of output 169 [2018-11-23 02:03:01,256 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:01,388 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:03:01,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 155 [2018-11-23 02:03:01,389 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:01,512 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:02,154 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 51 treesize of output 41 [2018-11-23 02:03:02,156 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:02,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 73 [2018-11-23 02:03:02,172 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:02,177 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 43 [2018-11-23 02:03:02,178 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:02,560 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 169 treesize of output 167 [2018-11-23 02:03:02,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 144 [2018-11-23 02:03:02,564 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:02,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 121 [2018-11-23 02:03:02,677 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:02,776 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:03,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:03,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:03,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:03,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:03,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:03,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:03,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:03,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:03,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 163 [2018-11-23 02:03:03,190 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 02:03:03,190 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:03,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-11-23 02:03:03,387 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:03,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 45 [2018-11-23 02:03:03,457 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:03,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2018-11-23 02:03:03,590 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:03,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 93 [2018-11-23 02:03:03,670 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:03,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 85 [2018-11-23 02:03:03,727 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:03,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-11-23 02:03:03,779 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:03,826 INFO L267 ElimStorePlain]: Start of recursive call 31: 9 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 02:03:04,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,190 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,196 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 93 [2018-11-23 02:03:04,200 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:04,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,204 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 45 treesize of output 45 [2018-11-23 02:03:04,206 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:04,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 113 [2018-11-23 02:03:04,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 02:03:04,527 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:04,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 9 [2018-11-23 02:03:04,565 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:04,594 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:04,596 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 79 treesize of output 75 [2018-11-23 02:03:04,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 9 [2018-11-23 02:03:04,599 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:04,614 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:04,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:04,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 166 [2018-11-23 02:03:04,933 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 154 [2018-11-23 02:03:04,934 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 02:03:05,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:05,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-11-23 02:03:05,349 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:05,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 130 treesize of output 118 [2018-11-23 02:03:05,649 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:05,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:05,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 97 [2018-11-23 02:03:05,898 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:06,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:06,087 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 118 treesize of output 113 [2018-11-23 02:03:06,087 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:06,254 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 125 treesize of output 116 [2018-11-23 02:03:06,254 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:06,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:06,402 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 116 treesize of output 111 [2018-11-23 02:03:06,402 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:06,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-11-23 02:03:06,539 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:06,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 99 [2018-11-23 02:03:06,663 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:06,948 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 99 treesize of output 92 [2018-11-23 02:03:06,948 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:07,235 INFO L267 ElimStorePlain]: Start of recursive call 46: 12 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:03:07,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 126 [2018-11-23 02:03:07,751 INFO L478 Elim1Store]: Elim1 applied some 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 18 treesize of output 67 [2018-11-23 02:03:07,751 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 02:03:07,764 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:07,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 11 treesize of output 1 [2018-11-23 02:03:07,822 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:07,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-11-23 02:03:07,850 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:07,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-23 02:03:07,865 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:07,872 INFO L267 ElimStorePlain]: Start of recursive call 57: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:07,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:07,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 126 [2018-11-23 02:03:07,983 INFO L478 Elim1Store]: Elim1 applied some 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 18 treesize of output 67 [2018-11-23 02:03:07,984 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 02:03:07,996 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,049 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 11 treesize of output 1 [2018-11-23 02:03:08,049 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,070 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-11-23 02:03:08,071 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,083 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-23 02:03:08,084 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,088 INFO L267 ElimStorePlain]: Start of recursive call 62: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:08,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:08,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:08,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:08,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:08,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:08,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:08,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 122 [2018-11-23 02:03:08,190 INFO L478 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 142 [2018-11-23 02:03:08,193 INFO L267 ElimStorePlain]: Start of recursive call 68: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-11-23 02:03:08,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-23 02:03:08,316 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-11-23 02:03:08,388 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,453 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 37 treesize of output 25 [2018-11-23 02:03:08,454 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-23 02:03:08,505 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 02:03:08,521 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,527 INFO L267 ElimStorePlain]: Start of recursive call 67: 9 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 12 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:08,567 INFO L202 ElimStorePlain]: Needed 73 recursive calls to eliminate 20 variables, input treesize:777, output treesize:9 [2018-11-23 02:03:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:03:08,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:03:10,239 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 02:03:10,366 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 02:03:10,476 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 02:03:10,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,500 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,542 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,565 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,765 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,786 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,787 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,806 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,807 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,828 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,829 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:10,847 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:11,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2018-11-23 02:03:11,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-11-23 02:03:11,020 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,024 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2018-11-23 02:03:11,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-11-23 02:03:11,032 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,037 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,056 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 69 treesize of output 41 [2018-11-23 02:03:11,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 5 [2018-11-23 02:03:11,062 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,064 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:03:11,091 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:122, output treesize:72 [2018-11-23 02:03:11,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:03:11,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:03:11,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:03:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:03:11,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:03:11,348 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-11-23 02:03:11,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 02:03:11,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:11,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:11,365 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-11-23 02:03:11,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 02:03:11,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:03:11,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-23 02:03:11,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 02:03:11,410 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-11-23 02:03:11,410 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-11-23 02:03:11,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 02:03:11,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 02:03:11,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 02:03:11,472 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-11-23 02:03:11,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,492 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-11-23 02:03:11,564 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 72 treesize of output 62 [2018-11-23 02:03:11,573 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-11-23 02:03:11,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-11-23 02:03:11,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:11,658 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 24 treesize of output 39 [2018-11-23 02:03:11,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 88 [2018-11-23 02:03:11,781 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 38 treesize of output 39 [2018-11-23 02:03:11,781 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:11,820 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 70 treesize of output 69 [2018-11-23 02:03:11,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:11,825 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 70 treesize of output 84 [2018-11-23 02:03:11,825 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,845 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,867 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:11,893 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:143, output treesize:92 [2018-11-23 02:03:12,004 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:12,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:12,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:12,030 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 95 treesize of output 98 [2018-11-23 02:03:12,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:12,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:12,102 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 121 [2018-11-23 02:03:12,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 02:03:12,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:12,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:12,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-23 02:03:12,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:12,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:12,289 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 48 treesize of output 50 [2018-11-23 02:03:12,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:12,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:12,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:12,331 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:132, output treesize:94 [2018-11-23 02:03:12,866 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 25 treesize of output 18 [2018-11-23 02:03:12,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 02:03:12,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:12,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:12,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:12,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:107, output treesize:99 [2018-11-23 02:03:13,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,227 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:03:13,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 148 [2018-11-23 02:03:13,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 51 [2018-11-23 02:03:13,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 02:03:13,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:03:13,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,533 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:03:13,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,549 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 141 treesize of output 167 [2018-11-23 02:03:13,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,599 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 119 [2018-11-23 02:03:13,600 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:03:13,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:03:13,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,680 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:03:13,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,700 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 143 treesize of output 169 [2018-11-23 02:03:13,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:13,774 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 135 [2018-11-23 02:03:13,776 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-23 02:03:13,971 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 02:03:14,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 8 xjuncts. [2018-11-23 02:03:14,355 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:199, output treesize:921 [2018-11-23 02:03:15,401 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-11-23 02:03:16,229 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-23 02:03:16,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:16,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:16,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:16,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:16,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:16,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:16,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:16,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:16,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 205 [2018-11-23 02:03:16,703 INFO L478 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 214 [2018-11-23 02:03:16,705 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-11-23 02:03:16,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 136 [2018-11-23 02:03:16,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:17,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2018-11-23 02:03:17,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:17,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 121 [2018-11-23 02:03:17,309 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:17,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 76 [2018-11-23 02:03:17,381 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:17,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-11-23 02:03:17,446 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:17,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 9 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 02:03:18,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,023 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 76 treesize of output 70 [2018-11-23 02:03:18,032 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-11-23 02:03:18,032 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:18,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,049 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 54 treesize of output 35 [2018-11-23 02:03:18,049 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:18,058 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:18,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 123 [2018-11-23 02:03:18,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,140 INFO L478 Elim1Store]: Elim1 applied some 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 82 [2018-11-23 02:03:18,148 INFO L267 ElimStorePlain]: Start of recursive call 13: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 15 xjuncts. [2018-11-23 02:03:18,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:18,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-23 02:03:18,295 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:18,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:03:18,327 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:18,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:03:18,352 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:18,372 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:18,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 217 [2018-11-23 02:03:18,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 202 [2018-11-23 02:03:18,875 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:19,038 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:03:19,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 182 [2018-11-23 02:03:19,039 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:19,185 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:19,658 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 194 treesize of output 192 [2018-11-23 02:03:19,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 177 [2018-11-23 02:03:19,672 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:19,813 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:03:19,813 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 159 treesize of output 155 [2018-11-23 02:03:19,813 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:19,944 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:20,400 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 194 treesize of output 192 [2018-11-23 02:03:20,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 169 [2018-11-23 02:03:20,415 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:20,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 158 [2018-11-23 02:03:20,571 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:20,709 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:03:20,710 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 171 treesize of output 165 [2018-11-23 02:03:20,710 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:20,795 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:03:21,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:21,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:21,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:21,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:21,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:21,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 148 treesize of output 172 [2018-11-23 02:03:21,268 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 169 [2018-11-23 02:03:21,268 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 02:03:21,789 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 131 treesize of output 119 [2018-11-23 02:03:21,789 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:22,095 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 131 treesize of output 116 [2018-11-23 02:03:22,096 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:22,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:22,389 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 133 treesize of output 124 [2018-11-23 02:03:22,390 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:22,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:22,682 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 119 treesize of output 112 [2018-11-23 02:03:22,683 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:22,946 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 115 treesize of output 105 [2018-11-23 02:03:22,946 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:23,174 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 99 treesize of output 92 [2018-11-23 02:03:23,174 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:23,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 100 [2018-11-23 02:03:23,426 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:23,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:23,671 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 116 treesize of output 110 [2018-11-23 02:03:23,672 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:23,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:23,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 97 [2018-11-23 02:03:23,880 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:24,055 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 116 treesize of output 106 [2018-11-23 02:03:24,055 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:24,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,209 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 106 treesize of output 101 [2018-11-23 02:03:24,209 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:24,350 INFO L267 ElimStorePlain]: Start of recursive call 27: 12 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:03:24,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,959 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,964 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:24,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 190 [2018-11-23 02:03:24,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:25,013 INFO L478 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 124 treesize of output 138 [2018-11-23 02:03:25,014 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 02:03:25,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 137 [2018-11-23 02:03:25,197 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:25,441 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 127 [2018-11-23 02:03:25,442 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:25,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 110 [2018-11-23 02:03:25,523 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:25,591 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2018-11-23 02:03:25,592 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:25,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 63 [2018-11-23 02:03:25,716 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:25,768 INFO L267 ElimStorePlain]: Start of recursive call 40: 9 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 02:03:26,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:26,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:26,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:26,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:26,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2018-11-23 02:03:26,400 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:26,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:26,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:26,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-11-23 02:03:26,406 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:26,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 167 treesize of output 179 [2018-11-23 02:03:26,979 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 155 treesize of output 146 [2018-11-23 02:03:26,979 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:29,698 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 146 treesize of output 133 [2018-11-23 02:03:29,699 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:32,332 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 123 treesize of output 109 [2018-11-23 02:03:32,332 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:34,696 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 109 treesize of output 97 [2018-11-23 02:03:34,696 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:36,271 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 135 treesize of output 126 [2018-11-23 02:03:36,272 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:44,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:44,421 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 126 treesize of output 120 [2018-11-23 02:03:44,422 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:45,749 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 114 treesize of output 97 [2018-11-23 02:03:45,749 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:46,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:46,935 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 109 treesize of output 93 [2018-11-23 02:03:46,935 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:47,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:47,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 100 [2018-11-23 02:03:47,916 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:48,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 93 [2018-11-23 02:03:48,692 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:49,455 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 122 treesize of output 103 [2018-11-23 02:03:49,455 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:50,132 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 103 treesize of output 93 [2018-11-23 02:03:50,132 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:50,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 0 case distinctions, treesize of input 135 treesize of output 126 [2018-11-23 02:03:50,863 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:52,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:03:52,864 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 121 treesize of output 100 [2018-11-23 02:03:52,865 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:53,497 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 125 treesize of output 115 [2018-11-23 02:03:53,498 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:54,149 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 100 treesize of output 93 [2018-11-23 02:03:54,149 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:54,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 105 [2018-11-23 02:03:54,760 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:55,941 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 114 treesize of output 102 [2018-11-23 02:03:55,941 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:56,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 93 [2018-11-23 02:03:56,497 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:57,067 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 130 treesize of output 111 [2018-11-23 02:03:57,068 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:57,625 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 111 treesize of output 104 [2018-11-23 02:03:57,625 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:58,137 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 104 treesize of output 97 [2018-11-23 02:03:58,137 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:03:58,615 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 126 treesize of output 114 [2018-11-23 02:03:58,615 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:59,109 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 114 treesize of output 104 [2018-11-23 02:03:59,110 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 02:03:59,603 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 104 treesize of output 97 [2018-11-23 02:03:59,604 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:04:00,056 INFO L267 ElimStorePlain]: Start of recursive call 49: 33 dim-1 vars, End of recursive call: 10 dim-0 vars, and 9 xjuncts. [2018-11-23 02:04:01,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 126 [2018-11-23 02:04:01,560 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 46 treesize of output 112 [2018-11-23 02:04:01,560 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:04:01,732 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:01,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:04:01,779 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:01,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, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-23 02:04:01,801 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:01,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 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 02:04:01,815 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:01,820 INFO L267 ElimStorePlain]: Start of recursive call 75: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:01,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,836 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:01,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 126 [2018-11-23 02:04:01,967 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 46 treesize of output 112 [2018-11-23 02:04:01,968 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 02:04:02,095 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11-23 02:04:02,147 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,169 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-11-23 02:04:02,169 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,181 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 11 treesize of output 1 [2018-11-23 02:04:02,181 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,186 INFO L267 ElimStorePlain]: Start of recursive call 80: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,191 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:02,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:02,195 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:02,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:02,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:02,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:02,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:04:02,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 122 [2018-11-23 02:04:02,243 INFO L478 Elim1Store]: Elim1 applied some 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 2 case distinctions, treesize of input 59 treesize of output 65 [2018-11-23 02:04:02,244 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 02:04:02,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-11-23 02:04:02,356 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2018-11-23 02:04:02,392 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,424 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 02:04:02,424 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,449 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 23 treesize of output 13 [2018-11-23 02:04:02,449 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 02:04:02,467 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,479 INFO L267 ElimStorePlain]: Start of recursive call 85: 9 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 12 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:02,574 INFO L202 ElimStorePlain]: Needed 91 recursive calls to eliminate 20 variables, input treesize:777, output treesize:9 [2018-11-23 02:04:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:04:02,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:04:06,707 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 02:04:06,974 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 02:04:07,130 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 02:04:07,238 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 02:04:07,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 19 treesize of output 13 [2018-11-23 02:04:07,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 02:04:07,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:04:07,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:04:07,322 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,327 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,331 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,374 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,378 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,378 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,380 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:04:07,381 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:04:07,385 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 02:04:07,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 02:04:07,419 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:130, output treesize:99 [2018-11-23 02:04:07,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:04:07,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 42 [2018-11-23 02:04:07,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 02:04:07,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 02:04:07,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3215, Unknown=4, NotChecked=0, Total=3422 [2018-11-23 02:04:07,732 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 42 states. [2018-11-23 02:04:10,425 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2018-11-23 02:04:13,805 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 02:04:14,504 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2018-11-23 02:04:14,925 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-23 02:04:15,646 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2018-11-23 02:04:16,108 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2018-11-23 02:04:16,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:04:16,697 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-11-23 02:04:16,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 02:04:16,698 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 68 [2018-11-23 02:04:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:04:16,699 INFO L225 Difference]: With dead ends: 109 [2018-11-23 02:04:16,699 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 02:04:16,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 113 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=356, Invalid=5340, Unknown=4, NotChecked=0, Total=5700 [2018-11-23 02:04:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 02:04:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-11-23 02:04:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 02:04:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-11-23 02:04:16,712 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 68 [2018-11-23 02:04:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:04:16,712 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-11-23 02:04:16,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 02:04:16,712 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-11-23 02:04:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 02:04:16,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:04:16,713 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:04:16,713 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:04:16,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:04:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1100821842, now seen corresponding path program 4 times [2018-11-23 02:04:16,714 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:04:16,714 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:04:16,728 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:04:16,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:04:16,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:04:16,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:04:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 02:04:16,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:04:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 02:04:16,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:04:16,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:04:16,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:04:16,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:04:16,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:04:16,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:04:16,982 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 02:04:16,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:04:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 02:04:17,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 02:04:17,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-11-23 02:04:17,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:04:17,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:04:17,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:04:17,031 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 9 states. [2018-11-23 02:04:17,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:04:17,148 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2018-11-23 02:04:17,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:04:17,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-23 02:04:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:04:17,149 INFO L225 Difference]: With dead ends: 117 [2018-11-23 02:04:17,149 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 02:04:17,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:04:17,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 02:04:17,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 02:04:17,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 02:04:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-11-23 02:04:17,161 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 68 [2018-11-23 02:04:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:04:17,161 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-11-23 02:04:17,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:04:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 02:04:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 02:04:17,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:04:17,162 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:04:17,162 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:04:17,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:04:17,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1989269782, now seen corresponding path program 2 times [2018-11-23 02:04:17,162 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 02:04:17,162 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 02:04:17,177 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 02:04:17,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:04:17,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:04:17,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:04:17,367 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:04:17,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:04:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:04:17,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:04:17,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_436407e3-2cdf-40ef-b557-ea256fec49c1/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-11-23 02:04:17,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 02:04:18,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:04:18,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:04:18,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:04:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:04:18,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:04:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 02:04:18,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 02:04:18,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 02:04:18,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 02:04:18,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:04:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:04:18,834 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 18 states. [2018-11-23 02:04:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:04:19,304 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-11-23 02:04:19,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:04:19,305 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 69 [2018-11-23 02:04:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:04:19,305 INFO L225 Difference]: With dead ends: 69 [2018-11-23 02:04:19,305 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 02:04:19,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-11-23 02:04:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 02:04:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 02:04:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 02:04:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 02:04:19,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 69 [2018-11-23 02:04:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:04:19,306 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 02:04:19,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 02:04:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 02:04:19,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 02:04:19,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 02:04:20,060 WARN L180 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-11-23 02:04:20,334 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-11-23 02:04:20,772 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-11-23 02:04:21,209 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2018-11-23 02:04:21,337 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-11-23 02:04:21,602 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-11-23 02:04:22,375 WARN L180 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 116 [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point exitEXIT(lines 561 563) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L451 ceAbstractionStarter]: At program point exitENTRY(lines 561 563) the Hoare annotation is: true [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point exitFINAL(lines 561 563) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L451 ceAbstractionStarter]: At program point L562(line 562) the Hoare annotation is: true [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L451 ceAbstractionStarter]: At program point dll_circular_destroyENTRY(lines 590 600) the Hoare annotation is: true [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point L591(lines 591 599) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L451 ceAbstractionStarter]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point L593-3(lines 593 597) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point L591-2(lines 590 600) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point dll_circular_destroyEXIT(lines 590 600) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 02:04:22,378 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 02:04:22,379 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 02:04:22,379 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 02:04:22,379 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 615 634) no Hoare annotation was computed. [2018-11-23 02:04:22,379 INFO L448 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-11-23 02:04:22,379 INFO L444 ceAbstractionStarter]: At program point L626(line 626) the Hoare annotation is: (let ((.cse17 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse18 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse16 (select .cse18 main_~s~0.offset)) (.cse6 (select .cse17 main_~s~0.offset))) (let ((.cse4 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32)))) (.cse3 (select (select |#memory_int| .cse16) (bvadd .cse6 (_ bv8 32))))) (let ((.cse0 (let ((.cse15 (select .cse18 (_ bv4 32)))) (let ((.cse14 (select |#memory_$Pointer$.base| .cse15)) (.cse13 (select |#memory_$Pointer$.offset| .cse16))) (let ((.cse7 (= (select .cse13 (_ bv4 32)) (_ bv0 32))) (.cse5 (select .cse17 (_ bv4 32))) (.cse8 (= main_~s~0.offset (_ bv0 32))) (.cse9 (= (select .cse17 (_ bv0 32)) (_ bv0 32))) (.cse10 (= .cse15 .cse16)) (.cse11 (= (select .cse14 (_ bv4 32)) main_~s~0.base)) (.cse12 (= (bvadd (bvneg (bvneg main_~len~0)) (_ bv1 32)) .cse3))) (or (and (= (bvadd .cse5 (_ bv4294967288 32)) .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 (= (select .cse13 .cse5) (_ bv0 32)) (= (select .cse14 .cse5) main_~s~0.base) .cse8 .cse9 .cse10 .cse11 .cse12)))))) (.cse1 (= .cse4 main_~len~0)) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= (bvadd (bvneg (bvneg (bvadd (bvneg main_~i~0) main_~expected~0))) (_ bv1 32)) .cse3) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (= .cse4 main_~expected~0) .cse1 (= main_~i~0 (_ bv0 32)) .cse2)))))) [2018-11-23 02:04:22,379 INFO L448 ceAbstractionStarter]: For program point L626-1(lines 626 628) no Hoare annotation was computed. [2018-11-23 02:04:22,379 INFO L444 ceAbstractionStarter]: At program point L622(line 622) the Hoare annotation is: (let ((.cse11 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse9 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse15 (select .cse11 (_ bv0 32))) (.cse14 (select .cse11 (_ bv4 32)))) (let ((.cse12 (select |#memory_$Pointer$.offset| .cse14)) (.cse10 (select |#memory_$Pointer$.base| .cse15)) (.cse13 (select .cse9 (_ bv4 32)))) (let ((.cse0 (= (select .cse10 .cse13) main_~s~0.base)) (.cse1 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse2 (= (select .cse10 (_ bv4 32)) main_~s~0.base)) (.cse3 (= (_ bv0 32) (select .cse12 (_ bv4 32)))) (.cse4 (= main_~s~0.offset (_ bv0 32))) (.cse5 (= .cse14 .cse15)) (.cse6 (= (_ bv0 32) (select .cse12 .cse13))) (.cse7 (not (= .cse10 .cse11))) (.cse8 (= (select .cse9 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) (= main_~i~0 (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))))) [2018-11-23 02:04:22,379 INFO L448 ceAbstractionStarter]: For program point L624-2(lines 624 629) no Hoare annotation was computed. [2018-11-23 02:04:22,379 INFO L448 ceAbstractionStarter]: For program point L622-1(lines 620 623) no Hoare annotation was computed. [2018-11-23 02:04:22,379 INFO L444 ceAbstractionStarter]: At program point L624-3(lines 624 629) the Hoare annotation is: (let ((.cse0 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse4 (= main_~i~0 (_ bv0 32)))) (let ((.cse1 (let ((.cse18 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse15 (select .cse18 main_~s~0.offset)) (.cse16 (select .cse18 (_ bv4 32))) (.cse17 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse6 (select .cse17 main_~s~0.offset)) (.cse14 (select |#memory_$Pointer$.base| .cse16)) (.cse13 (select |#memory_$Pointer$.offset| .cse15))) (let ((.cse7 (= (select .cse13 (_ bv4 32)) (_ bv0 32))) (.cse5 (select .cse17 (_ bv4 32))) (.cse8 (= main_~s~0.offset (_ bv0 32))) (.cse9 (= (select .cse17 (_ bv0 32)) (_ bv0 32))) (.cse10 (= .cse16 .cse15)) (.cse11 (= (select .cse14 (_ bv4 32)) main_~s~0.base)) (.cse12 (= (bvadd (bvneg (bvneg main_~len~0)) (_ bv1 32)) (select (select |#memory_int| .cse15) (bvadd .cse6 (_ bv8 32)))))) (or (and (= (bvadd .cse5 (_ bv4294967288 32)) .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse7 (= (select .cse13 .cse5) (_ bv0 32)) (= (select .cse14 .cse5) main_~s~0.base) .cse8 (not (= main_~s~0.base .cse15)) .cse9 .cse10 .cse11 .cse12))))))) (.cse2 (or (and (bvsgt main_~i~0 (_ bv0 32)) .cse0) (and .cse0 .cse4))) (.cse3 (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (and .cse2 .cse3) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2018-11-23 02:04:22,380 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 615 634) no Hoare annotation was computed. [2018-11-23 02:04:22,380 INFO L444 ceAbstractionStarter]: At program point L624-4(lines 624 629) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 02:04:22,380 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 632) no Hoare annotation was computed. [2018-11-23 02:04:22,380 INFO L444 ceAbstractionStarter]: At program point L618(line 618) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 02:04:22,380 INFO L444 ceAbstractionStarter]: At program point L620-2(lines 620 623) the Hoare annotation is: (let ((.cse9 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse21 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse22 (select .cse9 (_ bv0 32))) (.cse20 (select .cse9 (_ bv4 32)))) (let ((.cse23 (select |#memory_$Pointer$.offset| .cse20)) (.cse8 (select |#memory_$Pointer$.base| .cse22)) (.cse11 (select .cse21 (_ bv4 32)))) (let ((.cse1 (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv8 32))) main_~len~0)) (.cse0 (= (select .cse8 .cse11) main_~s~0.base)) (.cse3 (= (select .cse8 (_ bv4 32)) main_~s~0.base)) (.cse4 (= (_ bv0 32) (select .cse23 (_ bv4 32)))) (.cse5 (= main_~s~0.offset (_ bv0 32))) (.cse6 (= .cse20 .cse22)) (.cse7 (= (_ bv0 32) (select .cse23 .cse11))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse10 (= (select .cse21 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= .cse8 .cse9)) .cse10 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (let ((.cse19 (select .cse9 main_~s~0.offset))) (let ((.cse12 (select .cse21 main_~s~0.offset)) (.cse18 (select |#memory_$Pointer$.base| .cse20)) (.cse17 (select |#memory_$Pointer$.offset| .cse19))) (let ((.cse13 (= (select .cse17 (_ bv4 32)) (_ bv0 32))) (.cse14 (= .cse20 .cse19)) (.cse15 (= (select .cse18 (_ bv4 32)) main_~s~0.base)) (.cse16 (= (bvadd (bvneg (bvneg main_~len~0)) (_ bv1 32)) (select (select |#memory_int| .cse19) (bvadd .cse12 (_ bv8 32)))))) (or (and (= (bvadd .cse11 (_ bv4294967288 32)) .cse12) .cse13 .cse5 .cse10 .cse14 .cse15 .cse16) (and .cse13 (= (select .cse17 .cse11) (_ bv0 32)) (= (select .cse18 .cse11) main_~s~0.base) .cse5 .cse10 .cse14 .cse15 .cse16))))) .cse1 .cse2 (= (_ bv2 32) main_~i~0)) (and .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (= main_~i~0 (_ bv0 32)) .cse2 .cse10 (not (= .cse22 main_~s~0.base)))))))) [2018-11-23 02:04:22,380 INFO L448 ceAbstractionStarter]: For program point L618-1(line 618) no Hoare annotation was computed. [2018-11-23 02:04:22,380 INFO L448 ceAbstractionStarter]: For program point L620-3(lines 620 623) no Hoare annotation was computed. [2018-11-23 02:04:22,380 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 615 634) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 02:04:22,380 INFO L444 ceAbstractionStarter]: At program point L627(lines 615 634) the Hoare annotation is: false [2018-11-23 02:04:22,380 INFO L444 ceAbstractionStarter]: At program point L609-2(lines 609 612) the Hoare annotation is: (let ((.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse1 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse2 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse3 (= |dll_circular_update_at_#in~data| dll_circular_update_at_~data))) (let ((.cse4 (and .cse0 (= dll_circular_update_at_~index |dll_circular_update_at_#in~index|) .cse1 (= |dll_circular_update_at_#in~head.base| dll_circular_update_at_~head.base) .cse2 (= |dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset) .cse3))) (and (or (and (= (bvadd dll_circular_update_at_~index (_ bv1 32)) |dll_circular_update_at_#in~index|) .cse0 (= dll_circular_update_at_~head.base (select (select |#memory_$Pointer$.base| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|)) .cse1 (= (select (select |#memory_$Pointer$.offset| |dll_circular_update_at_#in~head.base|) |dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset) .cse2 .cse3) .cse4 (and (bvsgt (bvadd |dll_circular_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse2)) (or .cse4 (bvsgt |dll_circular_update_at_#in~index| (_ bv0 32)))))) [2018-11-23 02:04:22,380 INFO L448 ceAbstractionStarter]: For program point L609-3(lines 609 612) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point dll_circular_update_atFINAL(lines 608 614) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point dll_circular_update_atEXIT(lines 608 614) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L444 ceAbstractionStarter]: At program point dll_circular_update_atENTRY(lines 608 614) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point L578-1(line 578) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L444 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |dll_circular_create_#in~len| dll_circular_create_~len) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 02:04:22,381 INFO L444 ceAbstractionStarter]: At program point L577-2(lines 577 585) the Hoare annotation is: (let ((.cse2 (bvadd |dll_circular_create_#in~len| (_ bv4294967295 32))) (.cse0 (= (_ bv0 32) dll_circular_create_~head~0.offset)) (.cse3 (= (_ bv0 32) dll_circular_create_~new_head~0.offset))) (or (and (not (= dll_circular_create_~head~0.base (_ bv0 32))) .cse0 (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= |dll_circular_create_#in~len| dll_circular_create_~len) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base)) (let ((.cse1 (select (select |#memory_$Pointer$.base| dll_circular_create_~last~0.base) (_ bv4 32)))) (and (= dll_circular_create_~head~0.base .cse1) (= dll_circular_create_~new_head~0.base .cse1) .cse0 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse1) (_ bv0 32))) (= .cse2 dll_circular_create_~len) (= (select (select |#memory_$Pointer$.base| dll_circular_create_~head~0.base) dll_circular_create_~head~0.offset) dll_circular_create_~last~0.base) .cse3 (not (= dll_circular_create_~new_head~0.base dll_circular_create_~last~0.base)) (= dll_circular_create_~new_head~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| dll_circular_create_~new_head~0.base) dll_circular_create_~new_head~0.offset)) (_ bv4 32))))) (and (bvsgt .cse2 (_ bv1 32)) .cse0 .cse3))) [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point dll_circular_createEXIT(lines 574 589) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point L577-3(lines 577 585) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point dll_circular_createFINAL(lines 574 589) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point L580(lines 580 582) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L444 ceAbstractionStarter]: At program point dll_circular_createENTRY(lines 574 589) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 02:04:22,381 INFO L444 ceAbstractionStarter]: At program point L578(line 578) the Hoare annotation is: (or (bvsgt (bvadd |dll_circular_create_#in~len| (_ bv4294967295 32)) (_ bv1 32)) (and (not (= dll_circular_create_~head~0.base (_ bv0 32))) (= (_ bv0 32) dll_circular_create_~head~0.offset) (= (bvadd (select |#valid| dll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= |dll_circular_create_#in~len| dll_circular_create_~len) (= dll_circular_create_~head~0.base dll_circular_create_~last~0.base))) [2018-11-23 02:04:22,381 INFO L448 ceAbstractionStarter]: For program point L580-2(lines 580 582) no Hoare annotation was computed. [2018-11-23 02:04:22,381 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 564 573) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 02:04:22,382 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 564 573) no Hoare annotation was computed. [2018-11-23 02:04:22,382 INFO L451 ceAbstractionStarter]: At program point L567(line 567) the Hoare annotation is: true [2018-11-23 02:04:22,382 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-11-23 02:04:22,382 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 564 573) no Hoare annotation was computed. [2018-11-23 02:04:22,382 INFO L448 ceAbstractionStarter]: For program point L566-1(lines 566 568) no Hoare annotation was computed. [2018-11-23 02:04:22,382 INFO L448 ceAbstractionStarter]: For program point dll_circular_get_data_atFINAL(lines 601 607) no Hoare annotation was computed. [2018-11-23 02:04:22,382 INFO L448 ceAbstractionStarter]: For program point dll_circular_get_data_atEXIT(lines 601 607) no Hoare annotation was computed. [2018-11-23 02:04:22,382 INFO L451 ceAbstractionStarter]: At program point dll_circular_get_data_atENTRY(lines 601 607) the Hoare annotation is: true [2018-11-23 02:04:22,382 INFO L444 ceAbstractionStarter]: At program point L602-2(lines 602 605) the Hoare annotation is: (let ((.cse1 (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_6) (_ bv8 32)))))) (.cse2 (and (forall ((v_prenex_13 (_ BitVec 32))) (let ((.cse23 (select |#memory_$Pointer$.offset| v_prenex_13)) (.cse24 (select |#memory_$Pointer$.base| v_prenex_13))) (let ((.cse20 (select .cse24 (_ bv4 32))) (.cse21 (select .cse24 (_ bv0 32))) (.cse22 (select .cse23 (_ bv0 32)))) (or (not (= .cse20 .cse21)) (not (= .cse22 (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| .cse21) (_ bv4 32)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| .cse20) (_ bv4 32)) v_prenex_13)) (not (= (_ bv3 32) (select (select |#memory_int| .cse21) (bvadd .cse22 (_ bv8 32))))) (not (= (bvadd (select .cse23 (_ bv4 32)) (_ bv4294967288 32)) .cse22)))))) (forall ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse32 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14))) (let ((.cse28 (select .cse32 (_ bv0 32))) (.cse31 (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14)) (.cse27 (select .cse32 (_ bv4 32)))) (let ((.cse25 (select |#memory_$Pointer$.base| .cse27)) (.cse26 (select .cse31 (_ bv4 32))) (.cse30 (select |#memory_$Pointer$.offset| .cse28)) (.cse29 (select .cse31 (_ bv0 32)))) (or (not (= (select .cse25 (_ bv4 32)) v_main_~s~0.base_BEFORE_CALL_14)) (not (= (select .cse25 .cse26) v_main_~s~0.base_BEFORE_CALL_14)) (not (= .cse27 .cse28)) (= v_main_~s~0.base_BEFORE_CALL_14 .cse28) (not (= .cse29 (_ bv0 32))) (not (= (select .cse30 .cse26) (_ bv0 32))) (not (= (select .cse30 (_ bv4 32)) (_ bv0 32))) (not (= (bvadd (select (select |#memory_int| .cse28) (bvadd .cse29 (_ bv8 32))) (_ bv4294967293 32)) (_ bv0 32)))))))))) (.cse3 (and (exists ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_6) (_ bv8 32)))) (let ((.cse4 (= |dll_circular_get_data_at_#in~head.base| dll_circular_get_data_at_~head.base)) (.cse5 (= |dll_circular_get_data_at_#in~index| dll_circular_get_data_at_~index))) (or (and .cse4 .cse5 (exists ((v_prenex_13 (_ BitVec 32))) (let ((.cse10 (select |#memory_$Pointer$.offset| v_prenex_13))) (let ((.cse7 (select .cse10 (_ bv0 32))) (.cse11 (select |#memory_$Pointer$.base| v_prenex_13))) (let ((.cse6 (select .cse11 (_ bv4 32))) (.cse8 (select .cse11 (_ bv0 32))) (.cse9 (bvadd .cse7 (_ bv8 32)))) (and (= v_prenex_13 (select (select |#memory_$Pointer$.base| .cse6) (_ bv4 32))) (= .cse7 (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| .cse8) .cse9)) (= .cse6 .cse8) (= (select (select |#memory_$Pointer$.offset| .cse8) (_ bv4 32)) (_ bv0 32)) (= .cse9 (select .cse10 (_ bv4 32))))))))) (and (exists ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse19 (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14))) (let ((.cse15 (select .cse19 (_ bv4 32))) (.cse18 (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14)) (.cse13 (select .cse19 (_ bv0 32)))) (let ((.cse16 (select |#memory_$Pointer$.offset| .cse13)) (.cse14 (select .cse18 (_ bv0 32))) (.cse12 (select |#memory_$Pointer$.base| .cse15)) (.cse17 (select .cse18 (_ bv4 32)))) (and (= v_main_~s~0.base_BEFORE_CALL_14 (select .cse12 (_ bv4 32))) (= (_ bv3 32) (select (select |#memory_int| .cse13) (bvadd .cse14 (_ bv8 32)))) (= .cse15 .cse13) (= (select .cse16 (_ bv4 32)) (_ bv0 32)) (= (select .cse16 .cse17) (_ bv0 32)) (= .cse14 (_ bv0 32)) (not (= .cse13 v_main_~s~0.base_BEFORE_CALL_14)) (= (select .cse12 .cse17) v_main_~s~0.base_BEFORE_CALL_14)))))) .cse4 .cse5))) (= dll_circular_get_data_at_~head.offset |dll_circular_get_data_at_#in~head.offset|)))) (and (let ((.cse0 (bvadd |dll_circular_get_data_at_#in~index| (_ bv4294967295 32)))) (or (and (and (= (select (select |#memory_$Pointer$.base| |dll_circular_get_data_at_#in~head.base|) |dll_circular_get_data_at_#in~head.offset|) dll_circular_get_data_at_~head.base) (= (select (select |#memory_$Pointer$.offset| |dll_circular_get_data_at_#in~head.base|) |dll_circular_get_data_at_#in~head.offset|) dll_circular_get_data_at_~head.offset)) (= .cse0 dll_circular_get_data_at_~index)) (bvsgt .cse0 (_ bv0 32)) .cse1 .cse2 .cse3)) (or .cse1 .cse2 .cse3 (bvsgt |dll_circular_get_data_at_#in~index| (_ bv0 32))))) [2018-11-23 02:04:22,382 INFO L448 ceAbstractionStarter]: For program point L602-3(lines 602 605) no Hoare annotation was computed. [2018-11-23 02:04:22,389 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,394 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,394 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,395 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,395 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,395 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,395 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,395 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,395 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,396 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,396 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,396 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,396 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,396 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,396 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,397 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,397 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,397 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,397 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,397 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,397 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,397 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,398 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,398 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,398 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,403 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,404 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,405 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,406 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,406 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,406 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,408 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 02:04:22,410 INFO L168 Benchmark]: Toolchain (without parser) took 172582.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 943.3 MB in the beginning and 1.0 GB in the end (delta: -105.1 MB). Peak memory consumption was 304.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:04:22,411 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:04:22,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:04:22,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.12 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-11-23 02:04:22,411 INFO L168 Benchmark]: Boogie Preprocessor took 24.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:04:22,412 INFO L168 Benchmark]: RCFGBuilder took 347.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:04:22,412 INFO L168 Benchmark]: TraceAbstraction took 171799.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.0 MB). Peak memory consumption was 306.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:04:22,413 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 347.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 171799.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.0 MB). Peak memory consumption was 306.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 632]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 609]: Loop Invariant [2018-11-23 02:04:22,417 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,417 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,417 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,417 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,417 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,419 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,419 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,420 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,421 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,422 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,422 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,422 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,422 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,422 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,424 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,424 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-23 02:04:22,427 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,427 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-23 02:04:22,427 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,427 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,427 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,428 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,428 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,428 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,428 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,428 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,428 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,428 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,428 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,429 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,430 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-23 02:04:22,430 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((~bvadd64(index, 1bv32) == \old(index) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && head == #memory_$Pointer$[head][head]) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && #memory_$Pointer$[head][head] == head) && \old(#memory_$Pointer$) == #memory_$Pointer$) && \old(data) == data) || ((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && index == \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head) && \old(#memory_$Pointer$) == #memory_$Pointer$) && head == head) && \old(data) == data)) || ((~bvsgt32(~bvadd64(\old(index), 4294967295bv32), 0bv32) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown) && \old(#memory_$Pointer$) == #memory_$Pointer$)) && (((((((\old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown && index == \old(index)) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && head == head) && \old(#memory_$Pointer$) == #memory_$Pointer$) && head == head) && \old(data) == data) || ~bvsgt32(\old(index), 0bv32)) - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...