./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0684a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0684a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f0e5ff08d8d375b1c12be7373d81b68e548344f ........................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0684a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f0e5ff08d8d375b1c12be7373d81b68e548344f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:33:46,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:33:46,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:33:46,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:33:46,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:33:46,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:33:46,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:33:46,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:33:46,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:33:46,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:33:46,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:33:46,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:33:46,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:33:46,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:33:46,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:33:46,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:33:46,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:33:46,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:33:46,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:33:46,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:33:46,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:33:46,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:33:46,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:33:46,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:33:46,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:33:47,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:33:47,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:33:47,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:33:47,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:33:47,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:33:47,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:33:47,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:33:47,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:33:47,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:33:47,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:33:47,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:33:47,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:33:47,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:33:47,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:33:47,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:33:47,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:33:47,016 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:33:47,031 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:33:47,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:33:47,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:33:47,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:33:47,034 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:33:47,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:33:47,034 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:33:47,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:33:47,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:33:47,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:33:47,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:33:47,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:33:47,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:33:47,036 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:33:47,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:33:47,036 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:33:47,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:33:47,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:33:47,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:33:47,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:33:47,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:33:47,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:33:47,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:33:47,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:33:47,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:33:47,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:33:47,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:33:47,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:33:47,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer 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 -> Automizer 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 -> 6f0e5ff08d8d375b1c12be7373d81b68e548344f [2019-11-15 23:33:47,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:33:47,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:33:47,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:33:47,096 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:33:47,096 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:33:47,098 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0684a.c [2019-11-15 23:33:47,161 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data/6c45b39db/847206cdb8e1480c9bfff582623c6893/FLAG949c044e9 [2019-11-15 23:33:47,677 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:33:47,680 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/sv-benchmarks/c/float-newlib/double_req_bl_0684a.c [2019-11-15 23:33:47,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data/6c45b39db/847206cdb8e1480c9bfff582623c6893/FLAG949c044e9 [2019-11-15 23:33:48,014 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data/6c45b39db/847206cdb8e1480c9bfff582623c6893 [2019-11-15 23:33:48,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:33:48,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:33:48,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:48,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:33:48,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:33:48,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46020af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48, skipping insertion in model container [2019-11-15 23:33:48,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,032 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:33:48,058 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:33:48,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:48,410 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:33:48,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:48,538 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:33:48,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48 WrapperNode [2019-11-15 23:33:48,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:48,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:48,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:33:48,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:33:48,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:48,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:33:48,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:33:48,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:33:48,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... [2019-11-15 23:33:48,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:33:48,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:33:48,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:33:48,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:33:48,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/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 [2019-11-15 23:33:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:33:48,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-15 23:33:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:33:48,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 23:33:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:33:48,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:33:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:33:48,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-15 23:33:48,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:33:49,820 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:33:49,820 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-15 23:33:49,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:49 BoogieIcfgContainer [2019-11-15 23:33:49,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:33:49,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:33:49,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:33:49,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:33:49,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:33:48" (1/3) ... [2019-11-15 23:33:49,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396b6cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:33:49, skipping insertion in model container [2019-11-15 23:33:49,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:48" (2/3) ... [2019-11-15 23:33:49,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396b6cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:33:49, skipping insertion in model container [2019-11-15 23:33:49,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:49" (3/3) ... [2019-11-15 23:33:49,838 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0684a.c [2019-11-15 23:33:49,848 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:33:49,856 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:33:49,866 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:33:49,895 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:33:49,895 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:33:49,895 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:33:49,895 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:33:49,895 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:33:49,896 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:33:49,896 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:33:49,896 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:33:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-15 23:33:49,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:33:49,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:49,935 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:49,936 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:49,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-11-15 23:33:49,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:49,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896684713] [2019-11-15 23:33:49,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:49,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:49,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:50,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896684713] [2019-11-15 23:33:50,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:50,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:33:50,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147291489] [2019-11-15 23:33:50,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:33:50,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:50,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:33:50,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:33:50,123 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-11-15 23:33:50,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:50,156 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-11-15 23:33:50,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:33:50,158 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-15 23:33:50,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:50,171 INFO L225 Difference]: With dead ends: 246 [2019-11-15 23:33:50,172 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:33:50,175 INFO L600 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 [2019-11-15 23:33:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:33:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 23:33:50,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:33:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-11-15 23:33:50,229 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-11-15 23:33:50,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:50,230 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-11-15 23:33:50,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:33:50,230 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-11-15 23:33:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:33:50,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:50,232 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:33:50,232 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:50,233 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-11-15 23:33:50,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:50,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130445695] [2019-11-15 23:33:50,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:50,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:50,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:33:50,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:33:50,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130445695] [2019-11-15 23:33:50,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:33:50,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:33:50,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788316512] [2019-11-15 23:33:50,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:33:50,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:33:50,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:33:50,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:50,342 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-11-15 23:33:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:33:50,375 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-11-15 23:33:50,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:33:50,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:33:50,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:33:50,383 INFO L225 Difference]: With dead ends: 229 [2019-11-15 23:33:50,384 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:33:50,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:33:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:33:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 23:33:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:33:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-11-15 23:33:50,406 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-11-15 23:33:50,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:33:50,407 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-11-15 23:33:50,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:33:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-11-15 23:33:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:33:50,409 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:33:50,409 INFO L380 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] [2019-11-15 23:33:50,410 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:33:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:33:50,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-11-15 23:33:50,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:33:50,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28821208] [2019-11-15 23:33:50,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:50,413 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:33:50,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:33:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:33:51,095 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:33:51,098 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:33:51,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:33:51 BoogieIcfgContainer [2019-11-15 23:33:51,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:33:51,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:33:51,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:33:51,203 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:33:51,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:33:49" (3/4) ... [2019-11-15 23:33:51,208 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:33:51,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:33:51,212 INFO L168 Benchmark]: Toolchain (without parser) took 3192.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.1 MB in the beginning and 940.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 140.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,213 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:51,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,225 INFO L168 Benchmark]: Boogie Preprocessor took 129.56 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,226 INFO L168 Benchmark]: RCFGBuilder took 1062.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,227 INFO L168 Benchmark]: TraceAbstraction took 1377.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 940.6 MB in the end (delta: 102.0 MB). Peak memory consumption was 102.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:33:51,228 INFO L168 Benchmark]: Witness Printer took 7.58 ms. Allocated memory is still 1.2 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:33:51,236 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.56 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1062.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.3 MB). Peak memory consumption was 65.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1377.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 940.6 MB in the end (delta: 102.0 MB). Peak memory consumption was 102.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.58 ms. Allocated memory is still 1.2 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 286]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 285. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L276] double x = __VERIFIER_nondet_double(); [L277] double y = 1.0 / 0.0; [L260] __int32_t hx; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L262] ieee_double_shape_type gh_u; [L263] gh_u.value = (x) [L264] EXPR gh_u.parts.msw [L264] (hx) = gh_u.parts.msw [L266] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L280] isfinite_double(x) && isinf_double(y) [L246] __int32_t hx, lx; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L248] ieee_double_shape_type ew_u; [L249] ew_u.value = (x) [L250] EXPR ew_u.parts.msw [L250] (hx) = ew_u.parts.msw [L251] EXPR ew_u.parts.lsw [L251] (lx) = ew_u.parts.lsw [L253] hx &= 0x7fffffff [L254] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L255] hx = 0x7ff00000 - hx [L256] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L280] isfinite_double(x) && isinf_double(y) VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L280] COND TRUE isfinite_double(x) && isinf_double(y) [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L282] double res = __ieee754_atan2(y, x); [L285] COND TRUE res != pi_o_2 VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L286] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-9:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 0 SDslu, 163 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:33:53,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:33:53,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:33:53,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:33:53,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:33:53,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:33:53,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:33:53,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:33:53,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:33:53,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:33:53,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:33:53,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:33:53,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:33:53,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:33:53,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:33:53,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:33:53,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:33:53,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:33:53,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:33:53,868 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:33:53,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:33:53,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:33:53,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:33:53,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:33:53,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:33:53,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:33:53,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:33:53,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:33:53,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:33:53,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:33:53,879 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:33:53,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:33:53,880 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:33:53,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:33:53,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:33:53,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:33:53,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:33:53,883 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:33:53,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:33:53,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:33:53,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:33:53,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:33:53,900 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:33:53,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:33:53,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:33:53,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:33:53,903 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:33:53,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:33:53,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:33:53,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:33:53,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:33:53,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:33:53,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:33:53,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:33:53,905 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:33:53,905 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:33:53,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:33:53,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:33:53,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:33:53,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:33:53,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:33:53,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:33:53,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:33:53,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:33:53,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:33:53,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:33:53,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:33:53,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:33:53,908 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:33:53,909 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:33:53,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:33:53,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:33:53,909 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer 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 -> Automizer 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 -> 6f0e5ff08d8d375b1c12be7373d81b68e548344f [2019-11-15 23:33:53,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:33:53,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:33:53,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:33:53,963 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:33:53,963 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:33:53,964 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0684a.c [2019-11-15 23:33:54,025 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data/4d09b72d7/051c8739da6a44cea3bb52ff19cc8082/FLAG0aa5270d6 [2019-11-15 23:33:54,540 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:33:54,540 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/sv-benchmarks/c/float-newlib/double_req_bl_0684a.c [2019-11-15 23:33:54,549 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data/4d09b72d7/051c8739da6a44cea3bb52ff19cc8082/FLAG0aa5270d6 [2019-11-15 23:33:54,874 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/data/4d09b72d7/051c8739da6a44cea3bb52ff19cc8082 [2019-11-15 23:33:54,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:33:54,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:33:54,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:54,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:33:54,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:33:54,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:54" (1/1) ... [2019-11-15 23:33:54,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142e0523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:54, skipping insertion in model container [2019-11-15 23:33:54,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:33:54" (1/1) ... [2019-11-15 23:33:54,898 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:33:54,939 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:33:55,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:55,336 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:33:55,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:33:55,500 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:33:55,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55 WrapperNode [2019-11-15 23:33:55,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:33:55,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:55,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:33:55,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:33:55,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:33:55,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:33:55,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:33:55,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:33:55,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... [2019-11-15 23:33:55,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:33:55,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:33:55,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:33:55,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:33:55,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/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 [2019-11-15 23:33:55,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-15 23:33:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-15 23:33:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:33:55,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-15 23:33:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:33:55,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:33:55,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:33:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:33:55,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:34:36,888 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:34:36,888 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-15 23:34:36,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:36 BoogieIcfgContainer [2019-11-15 23:34:36,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:34:36,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:34:36,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:34:36,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:34:36,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:33:54" (1/3) ... [2019-11-15 23:34:36,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c81c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:36, skipping insertion in model container [2019-11-15 23:34:36,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:33:55" (2/3) ... [2019-11-15 23:34:36,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c81c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:36, skipping insertion in model container [2019-11-15 23:34:36,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:36" (3/3) ... [2019-11-15 23:34:36,903 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0684a.c [2019-11-15 23:34:36,914 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:34:36,924 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:34:36,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:34:36,973 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:34:36,974 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:34:36,974 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:34:36,974 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:34:36,974 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:34:36,975 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:34:36,975 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:34:36,975 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:34:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-15 23:34:37,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:34:37,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:37,010 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:37,012 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:37,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:37,019 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-11-15 23:34:37,034 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:34:37,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332338129] [2019-11-15 23:34:37,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-15 23:34:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:37,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:34:37,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:34:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:37,524 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:34:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:37,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332338129] [2019-11-15 23:34:37,535 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:37,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:34:37,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91786684] [2019-11-15 23:34:37,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:34:37,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:34:37,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:34:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:34:37,562 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-11-15 23:34:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:37,629 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-11-15 23:34:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:34:37,630 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-15 23:34:37,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:37,648 INFO L225 Difference]: With dead ends: 246 [2019-11-15 23:34:37,649 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:34:37,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:34:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:34:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 23:34:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:34:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-11-15 23:34:37,723 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-11-15 23:34:37,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:37,723 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-11-15 23:34:37,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:34:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-11-15 23:34:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:34:37,727 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:37,727 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:37,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 23:34:37,954 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-11-15 23:34:37,956 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:34:37,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260004231] [2019-11-15 23:34:37,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-15 23:34:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:38,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:34:38,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:34:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:38,445 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:34:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:38,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260004231] [2019-11-15 23:34:38,450 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:38,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:34:38,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807904239] [2019-11-15 23:34:38,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:38,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:34:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:38,453 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-11-15 23:34:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:38,539 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-11-15 23:34:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:38,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-15 23:34:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:38,546 INFO L225 Difference]: With dead ends: 229 [2019-11-15 23:34:38,546 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:34:38,548 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:34:38,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 23:34:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:34:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-11-15 23:34:38,560 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-11-15 23:34:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:38,561 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-11-15 23:34:38,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-11-15 23:34:38,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:34:38,563 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:38,563 INFO L380 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] [2019-11-15 23:34:38,786 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 23:34:38,786 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:38,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-11-15 23:34:38,788 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:34:38,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791812801] [2019-11-15 23:34:38,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-15 23:34:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:39,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:34:39,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:34:39,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:34:44,206 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 23:34:46,633 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-11-15 23:34:46,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:34:46,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 28 treesize of output 31 [2019-11-15 23:34:46,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:34:46,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:46,709 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:46,710 INFO L375 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 24 treesize of output 12 [2019-11-15 23:34:46,711 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:34:46,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:46,731 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:34:46,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:46,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:34:46,790 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:94, output treesize:55 [2019-11-15 23:34:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:47,266 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:34:47,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:34:47,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:47,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 61 [2019-11-15 23:34:47,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:47,671 INFO L375 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 41 [2019-11-15 23:34:47,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:34:47,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:47,742 INFO L375 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 41 treesize of output 25 [2019-11-15 23:34:47,743 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:34:47,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:47,756 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:34:47,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:47,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2019-11-15 23:34:47,818 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:47,819 INFO L375 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 19 treesize of output 11 [2019-11-15 23:34:47,819 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:34:47,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:47,842 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:34:47,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:34:47,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 23:34:47,895 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-15 23:34:48,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:34:48,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:34:48,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:34:49,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:34:49,941 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-15 23:34:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:49,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791812801] [2019-11-15 23:34:49,968 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:49,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-15 23:34:49,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580141103] [2019-11-15 23:34:49,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:34:49,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:34:49,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:34:49,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=401, Unknown=2, NotChecked=0, Total=462 [2019-11-15 23:34:49,971 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand 22 states. [2019-11-15 23:34:52,293 WARN L191 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-15 23:34:52,578 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-11-15 23:34:57,470 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 23:34:59,689 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 59 [2019-11-15 23:35:02,112 WARN L191 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 23:35:04,440 WARN L191 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-15 23:35:05,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:05,163 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2019-11-15 23:35:05,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:35:05,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-15 23:35:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:05,185 INFO L225 Difference]: With dead ends: 131 [2019-11-15 23:35:05,185 INFO L226 Difference]: Without dead ends: 58 [2019-11-15 23:35:05,186 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=225, Invalid=765, Unknown=2, NotChecked=0, Total=992 [2019-11-15 23:35:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-15 23:35:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-15 23:35:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 23:35:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-11-15 23:35:05,204 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 22 [2019-11-15 23:35:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:05,205 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-11-15 23:35:05,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:35:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-11-15 23:35:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:35:05,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:05,208 INFO L380 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] [2019-11-15 23:35:05,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 23:35:05,414 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash -988344331, now seen corresponding path program 1 times [2019-11-15 23:35:05,415 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:35:05,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413522860] [2019-11-15 23:35:05,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-15 23:35:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:05,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:35:05,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:35:06,483 WARN L191 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 23:35:06,718 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 23:35:07,291 WARN L191 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 23:35:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:07,297 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:35:09,748 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-15 23:35:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:09,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413522860] [2019-11-15 23:35:09,752 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:09,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 23:35:09,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774042163] [2019-11-15 23:35:09,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:35:09,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:35:09,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:35:09,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:35:09,754 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 10 states. [2019-11-15 23:35:10,249 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 23:35:10,726 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 23:35:11,076 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 23:35:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:11,316 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-15 23:35:11,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:35:11,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-15 23:35:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:11,322 INFO L225 Difference]: With dead ends: 62 [2019-11-15 23:35:11,323 INFO L226 Difference]: Without dead ends: 56 [2019-11-15 23:35:11,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:35:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-15 23:35:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-15 23:35:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 23:35:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-11-15 23:35:11,334 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 27 [2019-11-15 23:35:11,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:11,335 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-15 23:35:11,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:35:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-11-15 23:35:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:35:11,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:11,337 INFO L380 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] [2019-11-15 23:35:11,558 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 23:35:11,559 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash 268335592, now seen corresponding path program 1 times [2019-11-15 23:35:11,560 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:35:11,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478470591] [2019-11-15 23:35:11,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-15 23:35:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:12,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:35:12,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:35:12,189 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 23:35:12,873 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 23:35:13,110 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 23:35:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:13,116 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:35:16,472 WARN L191 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-15 23:35:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:16,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478470591] [2019-11-15 23:35:16,476 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:16,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-15 23:35:16,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379921578] [2019-11-15 23:35:16,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:35:16,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:35:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:35:16,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:35:16,477 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 10 states. [2019-11-15 23:35:16,992 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 23:35:17,480 WARN L191 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 23:35:18,092 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 23:35:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:18,131 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-11-15 23:35:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:35:18,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-15 23:35:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:18,133 INFO L225 Difference]: With dead ends: 60 [2019-11-15 23:35:18,133 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 23:35:18,133 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:35:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 23:35:18,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-15 23:35:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 23:35:18,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-11-15 23:35:18,142 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 29 [2019-11-15 23:35:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:18,142 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-11-15 23:35:18,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:35:18,143 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-11-15 23:35:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:35:18,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:18,144 INFO L380 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] [2019-11-15 23:35:18,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 23:35:18,344 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:18,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:18,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1159958932, now seen corresponding path program 1 times [2019-11-15 23:35:18,345 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:35:18,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121109578] [2019-11-15 23:35:18,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-15 23:35:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:18,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:35:18,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:35:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:18,817 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:35:19,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:19,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121109578] [2019-11-15 23:35:19,038 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:19,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 23:35:19,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566769481] [2019-11-15 23:35:19,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:35:19,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:35:19,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:35:19,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:35:19,042 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 12 states. [2019-11-15 23:35:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:19,512 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-11-15 23:35:19,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:35:19,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-15 23:35:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:19,524 INFO L225 Difference]: With dead ends: 55 [2019-11-15 23:35:19,524 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 23:35:19,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:35:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 23:35:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 23:35:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:35:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-11-15 23:35:19,532 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-11-15 23:35:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:19,532 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-11-15 23:35:19,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:35:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-11-15 23:35:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:35:19,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:19,534 INFO L380 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] [2019-11-15 23:35:19,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 23:35:19,734 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:19,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 378053105, now seen corresponding path program 1 times [2019-11-15 23:35:19,735 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:35:19,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495065852] [2019-11-15 23:35:19,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-15 23:35:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:20,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:35:20,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:35:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:20,330 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:35:20,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:20,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:35:20,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495065852] [2019-11-15 23:35:20,854 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:35:20,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-15 23:35:20,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797116122] [2019-11-15 23:35:20,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:35:20,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:35:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:35:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:35:20,858 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-11-15 23:35:21,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:35:21,670 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2019-11-15 23:35:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:35:21,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-15 23:35:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:35:21,683 INFO L225 Difference]: With dead ends: 38 [2019-11-15 23:35:21,683 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 23:35:21,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:35:21,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 23:35:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 23:35:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:35:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2019-11-15 23:35:21,690 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 31 [2019-11-15 23:35:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:35:21,691 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2019-11-15 23:35:21,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:35:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2019-11-15 23:35:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:35:21,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:35:21,692 INFO L380 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] [2019-11-15 23:35:21,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 23:35:21,893 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:35:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:35:21,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1190282480, now seen corresponding path program 1 times [2019-11-15 23:35:21,894 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:35:21,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894960818] [2019-11-15 23:35:21,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_193aaea9-496c-4d3d-9ddb-5558789b6a5c/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-15 23:35:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:35:23,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 23:35:23,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:35:23,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:23,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:23,617 INFO L341 Elim1Store]: treesize reduction 57, result has 43.6 percent of original size [2019-11-15 23:35:23,617 INFO L375 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 99 [2019-11-15 23:35:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:23,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:23,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:23,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:24,087 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-15 23:35:24,087 INFO L567 ElimStorePlain]: treesize reduction 55, result has 68.4 percent of original size [2019-11-15 23:35:24,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:35:24,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:35:24,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:121, output treesize:119 [2019-11-15 23:35:24,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:35:24,214 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 23:35:24,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:35:24,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:35:24,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:24,471 INFO L235 Elim1Store]: Index analysis took 152 ms [2019-11-15 23:35:24,739 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:35:24,739 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:35:24,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 138 treesize of output 235 [2019-11-15 23:35:24,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:24,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:24,898 INFO L235 Elim1Store]: Index analysis took 127 ms [2019-11-15 23:35:25,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:25,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 203 [2019-11-15 23:35:25,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:25,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:25,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:25,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 208 [2019-11-15 23:35:25,225 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:25,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:25,395 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:25,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 208 [2019-11-15 23:35:25,397 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:27,219 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-11-15 23:35:27,219 INFO L567 ElimStorePlain]: treesize reduction 198, result has 72.7 percent of original size [2019-11-15 23:35:27,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:35:27,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:27,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 129 treesize of output 145 [2019-11-15 23:35:27,332 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:27,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,437 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:35:27,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:27,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 134 treesize of output 150 [2019-11-15 23:35:27,447 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:27,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,576 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:35:27,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:27,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 132 treesize of output 148 [2019-11-15 23:35:27,586 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:27,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:27,630 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:35:27,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:27,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 132 treesize of output 148 [2019-11-15 23:35:27,650 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:28,985 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-11-15 23:35:28,986 INFO L567 ElimStorePlain]: treesize reduction 59, result has 89.7 percent of original size [2019-11-15 23:35:28,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:28,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 23 dim-0 vars, and 4 xjuncts. [2019-11-15 23:35:28,989 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:542, output treesize:512 [2019-11-15 23:35:28,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:28,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:28,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:28,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,568 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2019-11-15 23:35:29,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:29,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:35:30,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:30,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:31,260 INFO L235 Elim1Store]: Index analysis took 832 ms [2019-11-15 23:35:31,619 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-15 23:35:31,619 INFO L341 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-15 23:35:31,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 254 [2019-11-15 23:35:31,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:31,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:32,455 INFO L235 Elim1Store]: Index analysis took 758 ms [2019-11-15 23:35:32,806 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-15 23:35:32,806 INFO L341 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-15 23:35:32,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 157 treesize of output 254 [2019-11-15 23:35:32,808 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:32,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:33,528 INFO L235 Elim1Store]: Index analysis took 664 ms [2019-11-15 23:35:33,957 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-15 23:35:33,958 INFO L341 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-15 23:35:33,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 249 [2019-11-15 23:35:33,959 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:34,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:34,341 INFO L235 Elim1Store]: Index analysis took 301 ms [2019-11-15 23:35:34,726 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-11-15 23:35:34,727 INFO L341 Elim1Store]: treesize reduction 48, result has 73.9 percent of original size [2019-11-15 23:35:34,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 159 treesize of output 281 [2019-11-15 23:35:34,729 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:45,870 WARN L191 SmtUtils]: Spent 11.14 s on a formula simplification. DAG size of input: 275 DAG size of output: 220 [2019-11-15 23:35:45,871 INFO L567 ElimStorePlain]: treesize reduction 302, result has 65.1 percent of original size [2019-11-15 23:35:45,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:45,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:45,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:45,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:45,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:45,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:45,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:46,142 INFO L235 Elim1Store]: Index analysis took 232 ms [2019-11-15 23:35:46,251 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:35:46,285 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:46,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 181 [2019-11-15 23:35:46,287 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:46,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:46,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:46,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:46,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:46,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:46,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:46,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:46,800 INFO L235 Elim1Store]: Index analysis took 474 ms [2019-11-15 23:35:47,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,021 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:35:47,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:47,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 183 [2019-11-15 23:35:47,071 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:47,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,234 INFO L235 Elim1Store]: Index analysis took 135 ms [2019-11-15 23:35:47,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:35:47,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:47,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 181 [2019-11-15 23:35:47,341 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:47,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,396 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:35:47,534 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:35:47,594 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:35:47,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 178 [2019-11-15 23:35:47,595 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:35:50,003 WARN L191 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 254 DAG size of output: 227 [2019-11-15 23:35:50,003 INFO L567 ElimStorePlain]: treesize reduction 111, result has 83.9 percent of original size [2019-11-15 23:35:50,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:50,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:50,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:50,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:50,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 26 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 35 dim-0 vars, and 4 xjuncts. [2019-11-15 23:35:50,011 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:626, output treesize:580 [2019-11-15 23:35:50,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:50,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:50,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:50,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:54,849 WARN L191 SmtUtils]: Spent 2.63 s on a formula simplification that was a NOOP. DAG size: 299 [2019-11-15 23:35:54,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:54,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:54,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:54,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:57,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:57,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:57,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:57,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:59,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:59,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:35:59,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:01,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:01,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:01,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:01,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:36:04,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:04,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:07,030 INFO L235 Elim1Store]: Index analysis took 2509 ms [2019-11-15 23:36:07,813 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:36:07,813 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:36:07,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 172 treesize of output 294 [2019-11-15 23:36:07,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:07,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:09,583 INFO L235 Elim1Store]: Index analysis took 1617 ms [2019-11-15 23:36:10,292 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:36:10,293 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:36:10,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 161 treesize of output 258 [2019-11-15 23:36:10,294 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:10,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:12,295 INFO L235 Elim1Store]: Index analysis took 1891 ms [2019-11-15 23:36:12,870 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:36:12,871 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:36:12,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 159 treesize of output 256 [2019-11-15 23:36:12,872 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:13,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:14,593 INFO L235 Elim1Store]: Index analysis took 1656 ms [2019-11-15 23:36:15,129 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:36:15,130 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:36:15,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 169 treesize of output 291 [2019-11-15 23:36:15,131 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:15,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:17,289 INFO L235 Elim1Store]: Index analysis took 2013 ms [2019-11-15 23:36:17,966 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:36:17,967 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:36:17,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 174 treesize of output 296 [2019-11-15 23:36:17,968 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:18,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:18,921 INFO L235 Elim1Store]: Index analysis took 882 ms [2019-11-15 23:36:19,318 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:36:19,318 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:36:19,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 156 treesize of output 253 [2019-11-15 23:36:19,320 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:19,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:22,533 INFO L235 Elim1Store]: Index analysis took 3125 ms [2019-11-15 23:36:23,708 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-15 23:36:23,708 INFO L341 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-15 23:36:23,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 176 treesize of output 323 [2019-11-15 23:36:23,710 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:24,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:24,727 INFO L235 Elim1Store]: Index analysis took 902 ms [2019-11-15 23:36:25,413 WARN L191 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:36:25,413 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:36:25,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 163 treesize of output 285 [2019-11-15 23:36:25,415 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:51,582 WARN L191 SmtUtils]: Spent 26.17 s on a formula simplification. DAG size of input: 338 DAG size of output: 256 [2019-11-15 23:36:51,583 INFO L567 ElimStorePlain]: treesize reduction 1049, result has 43.9 percent of original size [2019-11-15 23:36:51,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:51,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:51,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:51,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:51,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:51,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:52,072 INFO L235 Elim1Store]: Index analysis took 442 ms [2019-11-15 23:36:52,279 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:36:52,347 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:36:52,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 217 [2019-11-15 23:36:52,348 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:52,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:52,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:52,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:52,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:52,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:52,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:52,864 INFO L235 Elim1Store]: Index analysis took 473 ms [2019-11-15 23:36:53,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,094 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:36:53,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:36:53,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 214 [2019-11-15 23:36:53,159 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:53,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,730 INFO L235 Elim1Store]: Index analysis took 530 ms [2019-11-15 23:36:53,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:53,923 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:36:54,057 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-15 23:36:54,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:36:54,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 182 treesize of output 270 [2019-11-15 23:36:54,060 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:54,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,586 INFO L235 Elim1Store]: Index analysis took 479 ms [2019-11-15 23:36:54,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,844 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:36:54,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:36:54,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 159 treesize of output 219 [2019-11-15 23:36:54,941 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:54,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:54,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:55,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:55,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:55,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:36:55,140 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:36:55,208 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:36:55,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 169 treesize of output 229 [2019-11-15 23:36:55,210 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 23:36:59,877 WARN L191 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 316 DAG size of output: 269 [2019-11-15 23:36:59,878 INFO L567 ElimStorePlain]: treesize reduction 233, result has 78.7 percent of original size [2019-11-15 23:36:59,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 38 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 51 dim-0 vars, and 5 xjuncts. [2019-11-15 23:36:59,915 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 40 variables, input treesize:1331, output treesize:862 [2019-11-15 23:36:59,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:36:59,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,731 WARN L191 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 416 DAG size of output: 342 [2019-11-15 23:37:10,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:10,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:13,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:13,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:13,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:13,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:37:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:16,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:18,112 INFO L235 Elim1Store]: Index analysis took 2232 ms [2019-11-15 23:37:18,512 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:37:18,512 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:37:18,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 156 treesize of output 253 [2019-11-15 23:37:18,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:20,314 INFO L235 Elim1Store]: Index analysis took 1688 ms [2019-11-15 23:37:20,883 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:37:20,883 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:37:20,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 163 treesize of output 285 [2019-11-15 23:37:20,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:22,443 INFO L235 Elim1Store]: Index analysis took 1387 ms [2019-11-15 23:37:22,929 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:37:22,929 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:37:22,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 159 treesize of output 256 [2019-11-15 23:37:22,930 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:23,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:24,181 INFO L235 Elim1Store]: Index analysis took 1188 ms [2019-11-15 23:37:24,654 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:37:24,654 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:37:24,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 169 treesize of output 291 [2019-11-15 23:37:24,655 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:25,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:27,017 INFO L235 Elim1Store]: Index analysis took 2245 ms [2019-11-15 23:37:27,741 WARN L191 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-15 23:37:27,742 INFO L341 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-15 23:37:27,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 176 treesize of output 323 [2019-11-15 23:37:27,743 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:28,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:29,279 INFO L235 Elim1Store]: Index analysis took 1417 ms [2019-11-15 23:37:29,840 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:37:29,840 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:37:29,841 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 174 treesize of output 296 [2019-11-15 23:37:29,842 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:30,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:31,233 INFO L235 Elim1Store]: Index analysis took 1297 ms [2019-11-15 23:37:31,757 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:37:31,757 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:37:31,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 172 treesize of output 294 [2019-11-15 23:37:31,758 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:32,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:32,355 INFO L235 Elim1Store]: Index analysis took 490 ms [2019-11-15 23:37:32,742 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:37:32,742 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:37:32,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 161 treesize of output 258 [2019-11-15 23:37:32,744 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:55,102 WARN L191 SmtUtils]: Spent 22.36 s on a formula simplification. DAG size of input: 337 DAG size of output: 254 [2019-11-15 23:37:55,103 INFO L567 ElimStorePlain]: treesize reduction 1057, result has 43.5 percent of original size [2019-11-15 23:37:55,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:55,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:55,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:55,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:55,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:55,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:55,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:55,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:55,749 INFO L235 Elim1Store]: Index analysis took 613 ms [2019-11-15 23:37:56,053 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:37:56,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:56,155 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 178 treesize of output 266 [2019-11-15 23:37:56,156 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:56,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,532 INFO L235 Elim1Store]: Index analysis took 339 ms [2019-11-15 23:37:56,660 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:37:56,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:56,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 225 [2019-11-15 23:37:56,714 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:56,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:56,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:57,112 INFO L235 Elim1Store]: Index analysis took 361 ms [2019-11-15 23:37:57,281 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:37:57,377 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:57,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 154 treesize of output 214 [2019-11-15 23:37:57,379 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:57,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:57,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:57,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:57,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:57,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:57,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:57,899 INFO L235 Elim1Store]: Index analysis took 465 ms [2019-11-15 23:37:58,103 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:37:58,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:58,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 217 [2019-11-15 23:37:58,158 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:58,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:58,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:58,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:58,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:58,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:58,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:58,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:58,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:37:58,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:58,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 159 treesize of output 219 [2019-11-15 23:37:58,401 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:02,197 WARN L191 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 315 DAG size of output: 268 [2019-11-15 23:38:02,197 INFO L567 ElimStorePlain]: treesize reduction 234, result has 78.5 percent of original size [2019-11-15 23:38:02,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 38 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 51 dim-0 vars, and 5 xjuncts. [2019-11-15 23:38:02,217 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 40 variables, input treesize:1331, output treesize:854 [2019-11-15 23:38:02,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:02,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:04,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:04,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:04,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:04,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:07,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:07,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:07,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:09,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:09,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:09,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:09,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:11,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:11,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:11,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:11,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:38:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:14,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:15,676 INFO L235 Elim1Store]: Index analysis took 1452 ms [2019-11-15 23:38:16,233 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:38:16,233 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:38:16,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 159 treesize of output 281 [2019-11-15 23:38:16,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:17,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:17,718 INFO L235 Elim1Store]: Index analysis took 1403 ms [2019-11-15 23:38:18,306 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-15 23:38:18,307 INFO L341 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-15 23:38:18,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 172 treesize of output 319 [2019-11-15 23:38:18,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:18,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:18,887 INFO L235 Elim1Store]: Index analysis took 519 ms [2019-11-15 23:38:19,159 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:38:19,159 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:38:19,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 152 treesize of output 249 [2019-11-15 23:38:19,160 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:19,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:19,984 INFO L235 Elim1Store]: Index analysis took 790 ms [2019-11-15 23:38:20,472 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:38:20,473 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:38:20,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 168 treesize of output 290 [2019-11-15 23:38:20,474 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:20,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:21,204 INFO L235 Elim1Store]: Index analysis took 687 ms [2019-11-15 23:38:21,608 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:38:21,608 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:38:21,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 165 treesize of output 287 [2019-11-15 23:38:21,610 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:21,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:22,518 INFO L235 Elim1Store]: Index analysis took 805 ms [2019-11-15 23:38:22,831 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:38:22,831 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:38:22,831 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 155 treesize of output 252 [2019-11-15 23:38:22,832 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:23,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:23,606 INFO L235 Elim1Store]: Index analysis took 691 ms [2019-11-15 23:38:23,911 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:38:23,911 INFO L341 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-15 23:38:23,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 157 treesize of output 254 [2019-11-15 23:38:23,912 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:24,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:24,492 INFO L235 Elim1Store]: Index analysis took 507 ms [2019-11-15 23:38:25,179 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-15 23:38:25,180 INFO L341 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-15 23:38:25,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 170 treesize of output 292 [2019-11-15 23:38:25,181 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:44,026 WARN L191 SmtUtils]: Spent 18.84 s on a formula simplification. DAG size of input: 334 DAG size of output: 251 [2019-11-15 23:38:44,026 INFO L567 ElimStorePlain]: treesize reduction 1045, result has 43.2 percent of original size [2019-11-15 23:38:44,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,268 INFO L235 Elim1Store]: Index analysis took 198 ms [2019-11-15 23:38:44,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:38:44,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:38:44,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 194 [2019-11-15 23:38:44,350 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:44,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,596 INFO L235 Elim1Store]: Index analysis took 211 ms [2019-11-15 23:38:44,645 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:38:44,673 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:38:44,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 189 [2019-11-15 23:38:44,674 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:44,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,912 INFO L235 Elim1Store]: Index analysis took 216 ms [2019-11-15 23:38:44,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:44,961 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:38:45,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:38:45,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 14 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 174 treesize of output 224 [2019-11-15 23:38:45,006 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:45,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,265 INFO L235 Elim1Store]: Index analysis took 219 ms [2019-11-15 23:38:45,320 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:38:45,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:38:45,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 192 [2019-11-15 23:38:45,350 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:45,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:45,430 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:38:45,460 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:38:45,460 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 200 [2019-11-15 23:38:45,461 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:49,003 WARN L191 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 293 DAG size of output: 259 [2019-11-15 23:38:49,003 INFO L567 ElimStorePlain]: treesize reduction 136, result has 85.4 percent of original size [2019-11-15 23:38:49,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 37 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 46 dim-0 vars, and 5 xjuncts. [2019-11-15 23:38:49,015 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 39 variables, input treesize:1299, output treesize:794 [2019-11-15 23:38:49,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:49,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:51,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:51,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:51,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:51,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:53,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:53,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:53,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:53,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:56,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:56,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:56,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:56,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:38:58,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:38:58,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:58,732 INFO L235 Elim1Store]: Index analysis took 336 ms [2019-11-15 23:38:58,834 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:38:58,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 159 treesize of output 243 [2019-11-15 23:38:58,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:58,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:59,291 INFO L235 Elim1Store]: Index analysis took 425 ms [2019-11-15 23:38:59,396 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-15 23:38:59,396 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:38:59,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 162 treesize of output 246 [2019-11-15 23:38:59,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:38:59,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:38:59,938 INFO L235 Elim1Store]: Index analysis took 505 ms [2019-11-15 23:39:00,058 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-15 23:39:00,058 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:00,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 164 treesize of output 248 [2019-11-15 23:39:00,059 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:00,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:00,566 INFO L235 Elim1Store]: Index analysis took 464 ms [2019-11-15 23:39:00,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:00,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 153 treesize of output 237 [2019-11-15 23:39:00,663 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:00,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:01,031 INFO L235 Elim1Store]: Index analysis took 336 ms [2019-11-15 23:39:01,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:01,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 151 treesize of output 197 [2019-11-15 23:39:01,089 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:01,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:01,464 INFO L235 Elim1Store]: Index analysis took 338 ms [2019-11-15 23:39:01,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:01,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 146 treesize of output 192 [2019-11-15 23:39:01,518 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:01,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:02,249 INFO L235 Elim1Store]: Index analysis took 674 ms [2019-11-15 23:39:02,427 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-15 23:39:02,428 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:02,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 166 treesize of output 296 [2019-11-15 23:39:02,429 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:02,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:02,617 INFO L235 Elim1Store]: Index analysis took 140 ms [2019-11-15 23:39:02,675 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:02,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 149 treesize of output 195 [2019-11-15 23:39:02,677 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:06,759 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 301 DAG size of output: 262 [2019-11-15 23:39:06,759 INFO L567 ElimStorePlain]: treesize reduction 498, result has 60.0 percent of original size [2019-11-15 23:39:06,796 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:06,914 INFO L235 Elim1Store]: Index analysis took 130 ms [2019-11-15 23:39:06,949 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:39:06,979 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:06,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 192 [2019-11-15 23:39:06,980 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:07,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:07,266 INFO L235 Elim1Store]: Index analysis took 257 ms [2019-11-15 23:39:07,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:39:07,367 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:07,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 183 [2019-11-15 23:39:07,369 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:07,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:07,552 INFO L235 Elim1Store]: Index analysis took 156 ms [2019-11-15 23:39:07,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:07,603 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:39:07,633 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:07,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 183 [2019-11-15 23:39:07,634 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:07,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:07,782 INFO L235 Elim1Store]: Index analysis took 127 ms [2019-11-15 23:39:07,814 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:39:07,883 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:07,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 231 [2019-11-15 23:39:07,884 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:07,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:08,000 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:39:08,028 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:08,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 180 [2019-11-15 23:39:08,029 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 23:39:11,744 WARN L191 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 304 DAG size of output: 271 [2019-11-15 23:39:11,744 INFO L567 ElimStorePlain]: treesize reduction 159, result has 82.5 percent of original size [2019-11-15 23:39:11,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 37 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 46 dim-0 vars, and 5 xjuncts. [2019-11-15 23:39:11,752 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 39 variables, input treesize:1251, output treesize:751 [2019-11-15 23:39:11,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:11,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:27,242 WARN L191 SmtUtils]: Spent 6.60 s on a formula simplification. DAG size of input: 390 DAG size of output: 170 [2019-11-15 23:39:27,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:33,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:33,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:39,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:39,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:39,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:39,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:39:39,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:39:39,990 INFO L235 Elim1Store]: Index analysis took 398 ms [2019-11-15 23:39:39,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:39:39,998 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 200 treesize of output 122 [2019-11-15 23:39:39,999 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:39:41,638 INFO L235 Elim1Store]: Index analysis took 287 ms [2019-11-15 23:39:41,675 INFO L341 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-11-15 23:39:41,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 220 treesize of output 146 [2019-11-15 23:39:41,676 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:41:03,392 WARN L191 SmtUtils]: Spent 1.36 m on a formula simplification. DAG size of input: 185 DAG size of output: 158 [2019-11-15 23:41:03,392 INFO L567 ElimStorePlain]: treesize reduction 141, result has 79.0 percent of original size [2019-11-15 23:41:03,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:41:04,537 INFO L235 Elim1Store]: Index analysis took 1113 ms [2019-11-15 23:41:04,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:41:04,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 204 treesize of output 126 [2019-11-15 23:41:04,546 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:41:05,487 INFO L235 Elim1Store]: Index analysis took 239 ms [2019-11-15 23:41:05,523 INFO L341 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-11-15 23:41:05,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 224 treesize of output 150 [2019-11-15 23:41:05,524 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:41:23,771 WARN L191 SmtUtils]: Spent 18.25 s on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2019-11-15 23:41:23,772 INFO L567 ElimStorePlain]: treesize reduction 141, result has 59.9 percent of original size [2019-11-15 23:41:23,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 23 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-15 23:41:23,776 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 25 variables, input treesize:853, output treesize:135 [2019-11-15 23:41:27,746 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 71 DAG size of output: 39 [2019-11-15 23:41:29,949 WARN L191 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 23:41:32,810 WARN L191 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 23:41:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:41:33,034 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:41:38,628 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 23:41:40,809 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-15 23:41:47,889 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 23:41:59,218 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 23:42:16,184 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-15 23:42:39,110 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-15 23:43:02,394 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 23:43:02,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-15 23:43:02,596 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:580) 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:335) 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.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 42 more [2019-11-15 23:43:02,600 INFO L168 Benchmark]: Toolchain (without parser) took 547720.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 953.7 MB in the beginning and 905.1 MB in the end (delta: 48.6 MB). Peak memory consumption was 229.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:02,600 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:43:02,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:02,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.22 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. [2019-11-15 23:43:02,601 INFO L168 Benchmark]: Boogie Preprocessor took 135.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:02,601 INFO L168 Benchmark]: RCFGBuilder took 41130.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.5 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:02,602 INFO L168 Benchmark]: TraceAbstraction took 505707.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.0 GB in the beginning and 905.1 MB in the end (delta: 123.0 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:43:02,603 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -155.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.22 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 135.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 41130.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.5 MB). Peak memory consumption was 74.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 505707.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 51.4 MB). Free memory was 1.0 GB in the beginning and 905.1 MB in the end (delta: 123.0 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...