./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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 9898ce33ba90bf1deafb76b4145359648bf729c6 ..................................................................................................................................................................................................................................................................................................................................................................................... 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_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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 9898ce33ba90bf1deafb76b4145359648bf729c6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 05:12:38,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:12:38,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:12:38,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:12:38,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:12:38,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:12:38,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:12:38,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:12:38,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:12:38,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:12:38,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:12:38,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:12:38,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:12:38,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:12:38,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:12:38,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:12:38,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:12:38,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:12:38,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:12:38,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:12:38,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:12:38,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:12:38,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:12:38,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:12:38,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:12:38,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:12:38,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:12:38,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:12:38,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:12:38,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:12:38,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:12:38,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:12:38,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:12:38,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:12:38,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:12:38,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:12:38,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:12:38,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:12:38,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:12:38,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:12:38,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:12:38,588 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:12:38,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:12:38,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:12:38,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:12:38,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:12:38,607 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:12:38,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:12:38,608 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:12:38,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:12:38,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:12:38,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:12:38,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:12:38,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:12:38,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:12:38,609 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:12:38,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:12:38,610 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:12:38,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:12:38,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:12:38,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:12:38,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:12:38,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:12:38,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:12:38,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:12:38,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:12:38,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:12:38,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:12:38,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:12:38,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:12:38,613 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_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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 -> 9898ce33ba90bf1deafb76b4145359648bf729c6 [2019-11-20 05:12:38,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:12:38,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:12:38,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:12:38,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:12:38,758 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:12:38,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c [2019-11-20 05:12:38,808 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data/cfcecba90/cc75466678914a7591742af071760aae/FLAGbfc8d193c [2019-11-20 05:12:39,220 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:12:39,220 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/sv-benchmarks/c/float-newlib/double_req_bl_0684b.c [2019-11-20 05:12:39,229 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data/cfcecba90/cc75466678914a7591742af071760aae/FLAGbfc8d193c [2019-11-20 05:12:39,554 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data/cfcecba90/cc75466678914a7591742af071760aae [2019-11-20 05:12:39,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:12:39,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:12:39,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:12:39,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:12:39,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:12:39,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:12:39" (1/1) ... [2019-11-20 05:12:39,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dca4a1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:39, skipping insertion in model container [2019-11-20 05:12:39,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:12:39" (1/1) ... [2019-11-20 05:12:39,572 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:12:39,598 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:12:39,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:12:39,965 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:12:40,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:12:40,052 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:12:40,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40 WrapperNode [2019-11-20 05:12:40,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:12:40,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:12:40,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:12:40,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:12:40,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:12:40,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:12:40,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:12:40,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:12:40,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... [2019-11-20 05:12:40,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:12:40,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:12:40,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:12:40,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:12:40,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:12:40,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:12:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 05:12:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 05:12:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 05:12:40,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:12:40,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:12:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 05:12:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-20 05:12:40,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:12:41,037 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:12:41,037 INFO L285 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-20 05:12:41,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:12:41 BoogieIcfgContainer [2019-11-20 05:12:41,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:12:41,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:12:41,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:12:41,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:12:41,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:12:39" (1/3) ... [2019-11-20 05:12:41,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299450a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:12:41, skipping insertion in model container [2019-11-20 05:12:41,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:40" (2/3) ... [2019-11-20 05:12:41,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@299450a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:12:41, skipping insertion in model container [2019-11-20 05:12:41,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:12:41" (3/3) ... [2019-11-20 05:12:41,045 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0684b.c [2019-11-20 05:12:41,053 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:12:41,064 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:12:41,075 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:12:41,108 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:12:41,108 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:12:41,108 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:12:41,108 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:12:41,108 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:12:41,108 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:12:41,109 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:12:41,109 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:12:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-20 05:12:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:12:41,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:12:41,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:12:41,127 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:12:41,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:12:41,133 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-11-20 05:12:41,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:12:41,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517964981] [2019-11-20 05:12:41,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:12:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:12:41,273 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-20 05:12:41,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517964981] [2019-11-20 05:12:41,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:12:41,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 05:12:41,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499209849] [2019-11-20 05:12:41,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 05:12:41,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:12:41,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 05:12:41,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:12:41,291 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-11-20 05:12:41,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:12:41,318 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-11-20 05:12:41,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 05:12:41,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-20 05:12:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:12:41,330 INFO L225 Difference]: With dead ends: 246 [2019-11-20 05:12:41,330 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 05:12:41,333 INFO L630 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-20 05:12:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 05:12:41,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-20 05:12:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 05:12:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-11-20 05:12:41,375 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-11-20 05:12:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:12:41,375 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-11-20 05:12:41,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 05:12:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-11-20 05:12:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 05:12:41,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:12:41,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:12:41,376 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:12:41,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:12:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-11-20 05:12:41,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:12:41,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576977835] [2019-11-20 05:12:41,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:12:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:12:41,483 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-20 05:12:41,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576977835] [2019-11-20 05:12:41,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:12:41,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:12:41,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31333150] [2019-11-20 05:12:41,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:12:41,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:12:41,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:12:41,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:12:41,486 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-11-20 05:12:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:12:41,516 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-11-20 05:12:41,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:12:41,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 05:12:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:12:41,518 INFO L225 Difference]: With dead ends: 229 [2019-11-20 05:12:41,518 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 05:12:41,519 INFO L630 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-20 05:12:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 05:12:41,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-20 05:12:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 05:12:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-11-20 05:12:41,531 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-11-20 05:12:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:12:41,531 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-11-20 05:12:41,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:12:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-11-20 05:12:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:12:41,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:12:41,532 INFO L410 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-20 05:12:41,533 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:12:41,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:12:41,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-11-20 05:12:41,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:12:41,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527575046] [2019-11-20 05:12:41,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:12:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:12:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 05:12:41,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 05:12:41,849 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 05:12:41,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:12:41 BoogieIcfgContainer [2019-11-20 05:12:41,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:12:41,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:12:41,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:12:41,897 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:12:41,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:12:41" (3/4) ... [2019-11-20 05:12:41,901 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 05:12:41,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:12:41,903 INFO L168 Benchmark]: Toolchain (without parser) took 2345.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -62.1 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:41,904 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:12:41,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:41,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.71 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-20 05:12:41,906 INFO L168 Benchmark]: Boogie Preprocessor took 85.59 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-20 05:12:41,906 INFO L168 Benchmark]: RCFGBuilder took 829.14 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:41,907 INFO L168 Benchmark]: TraceAbstraction took 856.68 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: 64.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:12:41,907 INFO L168 Benchmark]: Witness Printer took 4.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:12:41,911 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 494.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.71 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. * Boogie Preprocessor took 85.59 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 829.14 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: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 856.68 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: 64.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. 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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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={6:0}, atanhi_atan={3:0}, atanlo_atan={5: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: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, 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.2s SatisfiabilityAnalysisTime, 0.0s 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-678e011 [2019-11-20 05:12:43,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:12:43,738 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:12:43,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:12:43,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:12:43,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:12:43,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:12:43,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:12:43,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:12:43,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:12:43,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:12:43,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:12:43,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:12:43,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:12:43,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:12:43,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:12:43,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:12:43,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:12:43,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:12:43,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:12:43,791 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:12:43,794 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:12:43,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:12:43,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:12:43,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:12:43,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:12:43,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:12:43,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:12:43,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:12:43,804 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:12:43,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:12:43,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:12:43,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:12:43,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:12:43,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:12:43,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:12:43,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:12:43,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:12:43,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:12:43,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:12:43,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:12:43,813 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 05:12:43,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:12:43,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:12:43,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:12:43,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:12:43,838 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:12:43,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:12:43,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:12:43,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:12:43,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:12:43,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:12:43,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:12:43,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:12:43,840 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 05:12:43,840 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 05:12:43,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:12:43,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:12:43,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:12:43,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:12:43,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:12:43,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:12:43,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:12:43,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:12:43,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:12:43,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:12:43,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:12:43,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:12:43,843 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 05:12:43,843 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 05:12:43,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:12:43,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 05:12:43,844 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_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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 -> 9898ce33ba90bf1deafb76b4145359648bf729c6 [2019-11-20 05:12:44,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:12:44,120 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:12:44,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:12:44,124 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:12:44,124 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:12:44,126 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0684b.c [2019-11-20 05:12:44,182 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data/afd96720f/eff79f1176a64f07ae1e470cb5c1c1ad/FLAGb6d818d35 [2019-11-20 05:12:44,561 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:12:44,562 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/sv-benchmarks/c/float-newlib/double_req_bl_0684b.c [2019-11-20 05:12:44,568 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data/afd96720f/eff79f1176a64f07ae1e470cb5c1c1ad/FLAGb6d818d35 [2019-11-20 05:12:44,988 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/bin/uautomizer/data/afd96720f/eff79f1176a64f07ae1e470cb5c1c1ad [2019-11-20 05:12:44,991 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:12:44,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:12:44,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:12:44,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:12:44,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:12:44,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:12:44" (1/1) ... [2019-11-20 05:12:44,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b8747c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:44, skipping insertion in model container [2019-11-20 05:12:44,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:12:44" (1/1) ... [2019-11-20 05:12:45,006 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:12:45,035 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:12:45,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:12:45,242 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:12:45,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:12:45,427 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:12:45,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45 WrapperNode [2019-11-20 05:12:45,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:12:45,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:12:45,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:12:45,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:12:45,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:12:45,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:12:45,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:12:45,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:12:45,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... [2019-11-20 05:12:45,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:12:45,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:12:45,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:12:45,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:12:45,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:12:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 05:12:45,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 05:12:45,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 05:12:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 05:12:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 05:12:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:12:45,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:12:45,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 05:12:45,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 05:13:23,628 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:13:23,628 INFO L285 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-20 05:13:23,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:13:23 BoogieIcfgContainer [2019-11-20 05:13:23,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:13:23,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:13:23,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:13:23,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:13:23,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:12:44" (1/3) ... [2019-11-20 05:13:23,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ccc663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:13:23, skipping insertion in model container [2019-11-20 05:13:23,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:12:45" (2/3) ... [2019-11-20 05:13:23,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ccc663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:13:23, skipping insertion in model container [2019-11-20 05:13:23,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:13:23" (3/3) ... [2019-11-20 05:13:23,637 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0684b.c [2019-11-20 05:13:23,651 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:13:23,660 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:13:23,672 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:13:23,706 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:13:23,706 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:13:23,706 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:13:23,707 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:13:23,707 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:13:23,707 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:13:23,707 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:13:23,708 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:13:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-20 05:13:23,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 05:13:23,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:13:23,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:13:23,736 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:13:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:13:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-11-20 05:13:23,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:13:23,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244293269] [2019-11-20 05:13:23,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:13:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:13:24,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 05:13:24,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:13:24,149 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-20 05:13:24,150 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:13:24,157 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-20 05:13:24,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244293269] [2019-11-20 05:13:24,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:13:24,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 05:13:24,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680409260] [2019-11-20 05:13:24,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 05:13:24,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:13:24,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 05:13:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 05:13:24,182 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-11-20 05:13:24,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:13:24,235 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-11-20 05:13:24,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 05:13:24,236 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-20 05:13:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:13:24,260 INFO L225 Difference]: With dead ends: 246 [2019-11-20 05:13:24,261 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 05:13:24,266 INFO L630 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-20 05:13:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 05:13:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-20 05:13:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 05:13:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-11-20 05:13:24,321 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-11-20 05:13:24,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:13:24,321 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-11-20 05:13:24,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 05:13:24,322 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-11-20 05:13:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 05:13:24,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:13:24,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:13:24,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 05:13:24,546 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:13:24,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:13:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-11-20 05:13:24,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:13:24,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125355981] [2019-11-20 05:13:24,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:13:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:13:24,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:13:24,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:13:24,998 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-20 05:13:24,998 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:13:25,001 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-20 05:13:25,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125355981] [2019-11-20 05:13:25,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:13:25,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 05:13:25,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007083267] [2019-11-20 05:13:25,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:13:25,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:13:25,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:13:25,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:13:25,004 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-11-20 05:13:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:13:25,046 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-11-20 05:13:25,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:13:25,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-20 05:13:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:13:25,052 INFO L225 Difference]: With dead ends: 229 [2019-11-20 05:13:25,052 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 05:13:25,054 INFO L630 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-20 05:13:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 05:13:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-20 05:13:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-20 05:13:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-11-20 05:13:25,073 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-11-20 05:13:25,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:13:25,074 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-11-20 05:13:25,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:13:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-11-20 05:13:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 05:13:25,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:13:25,079 INFO L410 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-20 05:13:25,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 05:13:25,300 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:13:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:13:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-11-20 05:13:25,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:13:25,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982679136] [2019-11-20 05:13:25,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:13:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:13:25,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 05:13:25,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:13:26,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:13:30,451 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 05:13:32,709 INFO L377 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-20 05:13:32,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:13:32,733 INFO L377 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-20 05:13:32,733 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:13:32,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:32,782 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:32,783 INFO L377 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-20 05:13:32,783 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:13:32,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:32,792 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-20 05:13:32,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:32,837 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-20 05:13:32,837 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:95, output treesize:56 [2019-11-20 05:13:33,169 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-20 05:13:33,169 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:13:33,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:13:33,403 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:33,404 INFO L377 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-20 05:13:33,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:33,436 INFO L377 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-20 05:13:33,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:13:33,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:33,481 INFO L377 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-20 05:13:33,481 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:13:33,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:33,509 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-20 05:13:33,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:33,537 INFO L377 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-20 05:13:33,559 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:33,559 INFO L377 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-20 05:13:33,560 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:13:33,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:33,587 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 05:13:33,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:13:33,633 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-20 05:13:33,633 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:108, output treesize:50 [2019-11-20 05:13:33,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:13:34,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:13:34,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:13:34,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:13:35,200 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 05:13:35,216 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-20 05:13:35,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982679136] [2019-11-20 05:13:35,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:13:35,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-20 05:13:35,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413873523] [2019-11-20 05:13:35,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-20 05:13:35,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:13:35,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-20 05:13:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=401, Unknown=2, NotChecked=0, Total=462 [2019-11-20 05:13:35,222 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand 22 states. [2019-11-20 05:13:35,951 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-11-20 05:13:36,224 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-11-20 05:13:40,872 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 05:13:43,038 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 05:13:45,604 WARN L191 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-20 05:13:47,801 WARN L191 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 05:13:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:13:48,475 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2019-11-20 05:13:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 05:13:48,486 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-11-20 05:13:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:13:48,487 INFO L225 Difference]: With dead ends: 131 [2019-11-20 05:13:48,487 INFO L226 Difference]: Without dead ends: 58 [2019-11-20 05:13:48,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=225, Invalid=765, Unknown=2, NotChecked=0, Total=992 [2019-11-20 05:13:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-20 05:13:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-20 05:13:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-20 05:13:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-11-20 05:13:48,499 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 22 [2019-11-20 05:13:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:13:48,500 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-11-20 05:13:48,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-20 05:13:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-11-20 05:13:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 05:13:48,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:13:48,502 INFO L410 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-20 05:13:48,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 05:13:48,722 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:13:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:13:48,723 INFO L82 PathProgramCache]: Analyzing trace with hash -990191373, now seen corresponding path program 1 times [2019-11-20 05:13:48,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:13:48,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668667324] [2019-11-20 05:13:48,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:13:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:13:49,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 05:13:49,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:13:49,409 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 05:13:49,722 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 05:13:49,926 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 05:13:49,932 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-20 05:13:49,932 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:13:51,991 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 05:13:51,996 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-20 05:13:51,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668667324] [2019-11-20 05:13:51,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:13:51,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 05:13:51,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290990982] [2019-11-20 05:13:51,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 05:13:51,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:13:51,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 05:13:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:13:51,999 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 10 states. [2019-11-20 05:13:54,609 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 05:13:55,105 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 05:13:55,422 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 05:13:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:13:55,661 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2019-11-20 05:13:55,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:13:55,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-20 05:13:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:13:55,664 INFO L225 Difference]: With dead ends: 62 [2019-11-20 05:13:55,664 INFO L226 Difference]: Without dead ends: 56 [2019-11-20 05:13:55,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:13:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-20 05:13:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-20 05:13:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-20 05:13:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-11-20 05:13:55,672 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 27 [2019-11-20 05:13:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:13:55,672 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-20 05:13:55,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 05:13:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-11-20 05:13:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 05:13:55,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:13:55,674 INFO L410 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-20 05:13:55,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 05:13:55,874 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:13:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:13:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash 266488550, now seen corresponding path program 1 times [2019-11-20 05:13:55,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:13:55,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485042320] [2019-11-20 05:13:55,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:13:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:13:56,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 05:13:56,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:13:56,578 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 05:13:56,715 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 05:13:57,026 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-20 05:13:57,031 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-20 05:13:57,031 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:13:59,289 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 05:13:59,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-20 05:13:59,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485042320] [2019-11-20 05:13:59,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:13:59,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 05:13:59,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849215735] [2019-11-20 05:13:59,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 05:13:59,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:13:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 05:13:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 05:13:59,298 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 10 states. [2019-11-20 05:14:00,116 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 05:14:00,471 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-20 05:14:00,902 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-11-20 05:14:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:14:00,936 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-11-20 05:14:00,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 05:14:00,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-20 05:14:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:14:00,938 INFO L225 Difference]: With dead ends: 60 [2019-11-20 05:14:00,938 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 05:14:00,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:14:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 05:14:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-20 05:14:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 05:14:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2019-11-20 05:14:00,947 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 29 [2019-11-20 05:14:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:14:00,947 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2019-11-20 05:14:00,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 05:14:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2019-11-20 05:14:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 05:14:00,949 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:14:00,949 INFO L410 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-20 05:14:01,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 05:14:01,166 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:14:01,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:14:01,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1159958932, now seen corresponding path program 1 times [2019-11-20 05:14:01,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:14:01,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276831964] [2019-11-20 05:14:01,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:14:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:14:01,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 05:14:01,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:14:01,609 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-20 05:14:01,610 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:14:01,797 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-20 05:14:01,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276831964] [2019-11-20 05:14:01,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:14:01,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 05:14:01,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739907147] [2019-11-20 05:14:01,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 05:14:01,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:14:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 05:14:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 05:14:01,800 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 12 states. [2019-11-20 05:14:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:14:02,276 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-11-20 05:14:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 05:14:02,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2019-11-20 05:14:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:14:02,285 INFO L225 Difference]: With dead ends: 55 [2019-11-20 05:14:02,285 INFO L226 Difference]: Without dead ends: 33 [2019-11-20 05:14:02,286 INFO L630 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-20 05:14:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-20 05:14:02,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-20 05:14:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 05:14:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-11-20 05:14:02,292 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-11-20 05:14:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:14:02,293 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-11-20 05:14:02,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 05:14:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-11-20 05:14:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-20 05:14:02,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:14:02,295 INFO L410 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-20 05:14:02,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 05:14:02,510 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:14:02,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:14:02,510 INFO L82 PathProgramCache]: Analyzing trace with hash 378053105, now seen corresponding path program 1 times [2019-11-20 05:14:02,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:14:02,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502825163] [2019-11-20 05:14:02,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:14:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:14:02,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 05:14:02,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:14:02,974 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-20 05:14:02,975 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:14:03,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:03,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:03,376 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-20 05:14:03,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502825163] [2019-11-20 05:14:03,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:14:03,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 05:14:03,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430118968] [2019-11-20 05:14:03,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 05:14:03,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 05:14:03,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 05:14:03,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-20 05:14:03,378 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2019-11-20 05:14:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:14:03,925 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2019-11-20 05:14:03,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 05:14:03,934 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-20 05:14:03,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:14:03,934 INFO L225 Difference]: With dead ends: 38 [2019-11-20 05:14:03,935 INFO L226 Difference]: Without dead ends: 33 [2019-11-20 05:14:03,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-11-20 05:14:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-20 05:14:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-20 05:14:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-20 05:14:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2019-11-20 05:14:03,941 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 31 [2019-11-20 05:14:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:14:03,942 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2019-11-20 05:14:03,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 05:14:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2019-11-20 05:14:03,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 05:14:03,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:14:03,943 INFO L410 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-20 05:14:04,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 05:14:04,159 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:14:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:14:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1188435438, now seen corresponding path program 1 times [2019-11-20 05:14:04,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 05:14:04,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551411052] [2019-11-20 05:14:04,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43ab1680-1cae-4e42-b98f-6fd1d48c23bf/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-20 05:14:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:14:05,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-20 05:14:05,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:14:05,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:05,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:05,671 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 27 [2019-11-20 05:14:05,671 INFO L343 Elim1Store]: treesize reduction 57, result has 43.6 percent of original size [2019-11-20 05:14:05,671 INFO L377 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-20 05:14:05,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:05,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:05,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:05,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:05,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:05,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:05,898 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-20 05:14:05,898 INFO L567 ElimStorePlain]: treesize reduction 55, result has 68.4 percent of original size [2019-11-20 05:14:05,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:14:05,900 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-20 05:14:05,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:121, output treesize:119 [2019-11-20 05:14:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:14:05,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:14:06,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:14:06,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:06,209 INFO L237 Elim1Store]: Index analysis took 128 ms [2019-11-20 05:14:06,407 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:14:06,407 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:14:06,407 INFO L377 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-20 05:14:06,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:06,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:06,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:06,573 INFO L377 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-20 05:14:06,574 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:06,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:06,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:06,719 INFO L377 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-20 05:14:06,720 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:06,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:06,846 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:06,846 INFO L377 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-20 05:14:06,847 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:08,237 WARN L191 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 114 DAG size of output: 97 [2019-11-20 05:14:08,237 INFO L567 ElimStorePlain]: treesize reduction 198, result has 72.7 percent of original size [2019-11-20 05:14:08,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:14:08,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:08,335 INFO L377 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-20 05:14:08,336 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:08,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:14:08,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:08,424 INFO L377 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-20 05:14:08,425 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:08,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,514 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:14:08,527 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:08,527 INFO L377 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-20 05:14:08,528 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:08,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:08,590 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:14:08,598 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:08,598 INFO L377 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-20 05:14:08,599 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:09,751 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2019-11-20 05:14:09,752 INFO L567 ElimStorePlain]: treesize reduction 59, result has 89.7 percent of original size [2019-11-20 05:14:09,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:09,754 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-20 05:14:09,755 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:542, output treesize:512 [2019-11-20 05:14:09,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:09,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:09,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:09,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,186 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2019-11-20 05:14:10,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:14:10,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:10,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:11,613 INFO L237 Elim1Store]: Index analysis took 725 ms [2019-11-20 05:14:11,946 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 05:14:11,946 INFO L343 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-20 05:14:11,946 INFO L377 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-20 05:14:11,948 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:12,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:12,581 INFO L237 Elim1Store]: Index analysis took 575 ms [2019-11-20 05:14:12,864 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 05:14:12,865 INFO L343 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-20 05:14:12,865 INFO L377 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-20 05:14:12,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:13,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:13,267 INFO L237 Elim1Store]: Index analysis took 361 ms [2019-11-20 05:14:13,518 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-20 05:14:13,520 INFO L343 Elim1Store]: treesize reduction 16, result has 87.2 percent of original size [2019-11-20 05:14:13,520 INFO L377 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-20 05:14:13,522 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:14,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:14,129 INFO L237 Elim1Store]: Index analysis took 515 ms [2019-11-20 05:14:14,556 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 60 [2019-11-20 05:14:14,556 INFO L343 Elim1Store]: treesize reduction 48, result has 73.9 percent of original size [2019-11-20 05:14:14,557 INFO L377 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-20 05:14:14,558 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:24,055 WARN L191 SmtUtils]: Spent 9.50 s on a formula simplification. DAG size of input: 275 DAG size of output: 220 [2019-11-20 05:14:24,056 INFO L567 ElimStorePlain]: treesize reduction 302, result has 65.1 percent of original size [2019-11-20 05:14:24,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,230 INFO L237 Elim1Store]: Index analysis took 154 ms [2019-11-20 05:14:24,316 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:14:24,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:24,345 INFO L377 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-20 05:14:24,346 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:24,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,620 INFO L237 Elim1Store]: Index analysis took 247 ms [2019-11-20 05:14:24,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,768 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:14:24,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:24,797 INFO L377 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-20 05:14:24,798 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:24,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,924 INFO L237 Elim1Store]: Index analysis took 107 ms [2019-11-20 05:14:24,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:24,992 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:14:25,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:25,019 INFO L377 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-20 05:14:25,020 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:25,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:25,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:25,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:25,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:25,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:25,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:25,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:25,185 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:14:25,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:14:25,221 INFO L377 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-20 05:14:25,222 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:27,185 WARN L191 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 254 DAG size of output: 227 [2019-11-20 05:14:27,186 INFO L567 ElimStorePlain]: treesize reduction 111, result has 83.9 percent of original size [2019-11-20 05:14:27,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:27,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:27,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:27,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:27,192 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-20 05:14:27,193 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:626, output treesize:580 [2019-11-20 05:14:27,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:27,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:27,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:31,762 WARN L191 SmtUtils]: Spent 2.47 s on a formula simplification that was a NOOP. DAG size: 299 [2019-11-20 05:14:31,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:31,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:31,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:31,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:34,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:34,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:34,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:34,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:36,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:36,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:36,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:36,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:38,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:38,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:38,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:38,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:40,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:14:40,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:40,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:40,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:40,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:40,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:40,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:40,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:40,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:14:41,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:42,839 INFO L237 Elim1Store]: Index analysis took 1878 ms [2019-11-20 05:14:43,596 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:14:43,596 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:14:43,596 INFO L377 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-20 05:14:43,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:43,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:45,187 INFO L237 Elim1Store]: Index analysis took 1450 ms [2019-11-20 05:14:45,599 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:14:45,599 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:14:45,599 INFO L377 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-20 05:14:45,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:45,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:47,045 INFO L237 Elim1Store]: Index analysis took 1342 ms [2019-11-20 05:14:47,421 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:14:47,422 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:14:47,422 INFO L377 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-20 05:14:47,423 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:47,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:49,057 INFO L237 Elim1Store]: Index analysis took 1522 ms [2019-11-20 05:14:49,519 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:14:49,519 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:14:49,520 INFO L377 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-20 05:14:49,521 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:49,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:51,049 INFO L237 Elim1Store]: Index analysis took 1454 ms [2019-11-20 05:14:51,486 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:14:51,486 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:14:51,487 INFO L377 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-20 05:14:51,488 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:51,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:52,047 INFO L237 Elim1Store]: Index analysis took 476 ms [2019-11-20 05:14:52,309 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:14:52,309 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:14:52,309 INFO L377 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-20 05:14:52,310 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:52,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:53,983 INFO L237 Elim1Store]: Index analysis took 1583 ms [2019-11-20 05:14:54,577 WARN L191 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-20 05:14:54,577 INFO L343 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-20 05:14:54,577 INFO L377 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-20 05:14:54,579 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 05:14:54,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:14:55,120 INFO L237 Elim1Store]: Index analysis took 443 ms [2019-11-20 05:14:55,891 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:14:55,891 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:14:55,892 INFO L377 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-20 05:14:55,893 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:15,146 WARN L191 SmtUtils]: Spent 19.25 s on a formula simplification. DAG size of input: 338 DAG size of output: 256 [2019-11-20 05:15:15,147 INFO L567 ElimStorePlain]: treesize reduction 1049, result has 43.9 percent of original size [2019-11-20 05:15:15,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,503 INFO L237 Elim1Store]: Index analysis took 324 ms [2019-11-20 05:15:15,650 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:15:15,701 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:15:15,701 INFO L377 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-20 05:15:15,702 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:15,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:15,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,071 INFO L237 Elim1Store]: Index analysis took 334 ms [2019-11-20 05:15:16,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,239 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:15:16,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:15:16,284 INFO L377 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-20 05:15:16,284 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:16,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,724 INFO L237 Elim1Store]: Index analysis took 406 ms [2019-11-20 05:15:16,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:16,882 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:15:17,001 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 05:15:17,001 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:15:17,002 INFO L377 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-20 05:15:17,003 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:17,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,412 INFO L237 Elim1Store]: Index analysis took 371 ms [2019-11-20 05:15:17,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,590 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:15:17,654 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:15:17,654 INFO L377 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-20 05:15:17,655 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:17,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:17,815 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:15:17,865 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:15:17,865 INFO L377 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-20 05:15:17,866 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:21,382 WARN L191 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 316 DAG size of output: 269 [2019-11-20 05:15:21,383 INFO L567 ElimStorePlain]: treesize reduction 233, result has 78.7 percent of original size [2019-11-20 05:15:21,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,410 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-20 05:15:21,410 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 40 variables, input treesize:1331, output treesize:862 [2019-11-20 05:15:21,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:21,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,310 WARN L191 SmtUtils]: Spent 9.36 s on a formula simplification. DAG size of input: 416 DAG size of output: 342 [2019-11-20 05:15:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:35,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:37,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:37,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:37,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:37,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:15:40,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:15:40,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:41,604 INFO L237 Elim1Store]: Index analysis took 1246 ms [2019-11-20 05:15:41,998 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:15:41,999 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:15:41,999 INFO L377 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-20 05:15:42,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:42,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:44,174 INFO L237 Elim1Store]: Index analysis took 2007 ms [2019-11-20 05:15:44,803 WARN L191 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:15:44,804 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:15:44,804 INFO L377 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-20 05:15:44,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:44,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:45,481 INFO L237 Elim1Store]: Index analysis took 606 ms [2019-11-20 05:15:45,993 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:15:45,993 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:15:45,993 INFO L377 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-20 05:15:45,994 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:47,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:47,762 INFO L237 Elim1Store]: Index analysis took 1600 ms [2019-11-20 05:15:48,346 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-20 05:15:48,347 INFO L343 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-20 05:15:48,347 INFO L377 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-20 05:15:48,348 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:48,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:49,699 INFO L237 Elim1Store]: Index analysis took 1274 ms [2019-11-20 05:15:50,154 WARN L191 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:15:50,154 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:15:50,154 INFO L377 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-20 05:15:50,156 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:50,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:51,839 INFO L237 Elim1Store]: Index analysis took 1595 ms [2019-11-20 05:15:52,384 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:15:52,384 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:15:52,385 INFO L377 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-20 05:15:52,386 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:52,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:53,462 INFO L237 Elim1Store]: Index analysis took 970 ms [2019-11-20 05:15:53,900 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:15:53,900 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:15:53,900 INFO L377 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-20 05:15:53,901 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 05:15:54,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:15:54,560 INFO L237 Elim1Store]: Index analysis took 582 ms [2019-11-20 05:15:55,054 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:15:55,054 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:15:55,055 INFO L377 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-20 05:15:55,056 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:17,609 WARN L191 SmtUtils]: Spent 22.55 s on a formula simplification. DAG size of input: 337 DAG size of output: 254 [2019-11-20 05:16:17,609 INFO L567 ElimStorePlain]: treesize reduction 1057, result has 43.5 percent of original size [2019-11-20 05:16:17,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:17,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:17,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:17,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:17,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:17,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:17,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:17,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:18,174 INFO L237 Elim1Store]: Index analysis took 529 ms [2019-11-20 05:16:18,386 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:16:18,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:16:18,477 INFO L377 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-20 05:16:18,478 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:18,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:18,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:18,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:18,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:18,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:18,963 INFO L237 Elim1Store]: Index analysis took 447 ms [2019-11-20 05:16:19,152 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:16:19,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:16:19,201 INFO L377 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-20 05:16:19,202 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:19,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,580 INFO L237 Elim1Store]: Index analysis took 343 ms [2019-11-20 05:16:19,747 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:16:19,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:16:19,793 INFO L377 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-20 05:16:19,794 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:19,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:19,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:20,268 INFO L237 Elim1Store]: Index analysis took 436 ms [2019-11-20 05:16:20,463 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:16:20,510 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:16:20,511 INFO L377 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-20 05:16:20,511 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:20,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:20,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:20,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:20,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:20,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:20,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:20,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:20,700 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:16:20,747 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:16:20,748 INFO L377 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-20 05:16:20,748 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:24,418 WARN L191 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 315 DAG size of output: 268 [2019-11-20 05:16:24,420 INFO L567 ElimStorePlain]: treesize reduction 234, result has 78.5 percent of original size [2019-11-20 05:16:24,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,433 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-20 05:16:24,434 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 40 variables, input treesize:1331, output treesize:854 [2019-11-20 05:16:24,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:24,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:27,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:27,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:27,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:27,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:29,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:29,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:29,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:29,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:31,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:31,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:31,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:31,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:34,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:34,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:34,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:34,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:16:36,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:16:36,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:38,095 INFO L237 Elim1Store]: Index analysis took 1533 ms [2019-11-20 05:16:38,538 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:16:38,538 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:16:38,538 INFO L377 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-20 05:16:38,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:39,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:40,243 INFO L237 Elim1Store]: Index analysis took 1614 ms [2019-11-20 05:16:41,119 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-11-20 05:16:41,119 INFO L343 Elim1Store]: treesize reduction 96, result has 62.9 percent of original size [2019-11-20 05:16:41,119 INFO L377 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-20 05:16:41,120 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:41,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:41,973 INFO L237 Elim1Store]: Index analysis took 800 ms [2019-11-20 05:16:42,276 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:16:42,276 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:16:42,276 INFO L377 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-20 05:16:42,277 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:42,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:43,294 INFO L237 Elim1Store]: Index analysis took 967 ms [2019-11-20 05:16:43,809 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:16:43,809 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:16:43,810 INFO L377 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-20 05:16:43,811 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:44,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:44,620 INFO L237 Elim1Store]: Index analysis took 759 ms [2019-11-20 05:16:45,047 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:16:45,048 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:16:45,048 INFO L377 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-20 05:16:45,049 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:45,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:46,013 INFO L237 Elim1Store]: Index analysis took 877 ms [2019-11-20 05:16:46,303 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:16:46,304 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:16:46,304 INFO L377 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-20 05:16:46,305 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:46,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:46,713 INFO L237 Elim1Store]: Index analysis took 335 ms [2019-11-20 05:16:46,993 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 05:16:46,993 INFO L343 Elim1Store]: treesize reduction 24, result has 82.0 percent of original size [2019-11-20 05:16:46,994 INFO L377 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-20 05:16:46,994 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 05:16:47,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:16:47,588 INFO L237 Elim1Store]: Index analysis took 501 ms [2019-11-20 05:16:48,050 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2019-11-20 05:16:48,050 INFO L343 Elim1Store]: treesize reduction 56, result has 70.8 percent of original size [2019-11-20 05:16:48,050 INFO L377 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-20 05:16:48,051 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:05,529 WARN L191 SmtUtils]: Spent 17.48 s on a formula simplification. DAG size of input: 334 DAG size of output: 251 [2019-11-20 05:17:05,529 INFO L567 ElimStorePlain]: treesize reduction 1045, result has 43.2 percent of original size [2019-11-20 05:17:05,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,763 INFO L237 Elim1Store]: Index analysis took 186 ms [2019-11-20 05:17:05,807 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:05,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:05,834 INFO L377 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-20 05:17:05,835 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:05,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:05,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,047 INFO L237 Elim1Store]: Index analysis took 179 ms [2019-11-20 05:17:06,095 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:06,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:06,122 INFO L377 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-20 05:17:06,123 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:06,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,318 INFO L237 Elim1Store]: Index analysis took 175 ms [2019-11-20 05:17:06,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,352 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:06,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:06,391 INFO L377 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-20 05:17:06,392 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:06,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,640 INFO L237 Elim1Store]: Index analysis took 209 ms [2019-11-20 05:17:06,686 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:06,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:06,713 INFO L377 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-20 05:17:06,714 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:06,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:06,794 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:06,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:06,824 INFO L377 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-20 05:17:06,825 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:10,051 WARN L191 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 293 DAG size of output: 259 [2019-11-20 05:17:10,052 INFO L567 ElimStorePlain]: treesize reduction 136, result has 85.4 percent of original size [2019-11-20 05:17:10,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,061 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-20 05:17:10,061 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 39 variables, input treesize:1299, output treesize:794 [2019-11-20 05:17:10,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:10,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:12,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:12,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:12,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:14,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:14,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:14,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:14,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:16,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:16,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:16,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:16,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 05:17:19,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:19,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:19,692 INFO L237 Elim1Store]: Index analysis took 413 ms [2019-11-20 05:17:19,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:19,789 INFO L377 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-20 05:17:19,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:19,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:20,214 INFO L237 Elim1Store]: Index analysis took 377 ms [2019-11-20 05:17:20,330 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 05:17:20,330 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:20,331 INFO L377 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-20 05:17:20,332 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:20,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:21,054 INFO L237 Elim1Store]: Index analysis took 692 ms [2019-11-20 05:17:21,160 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-20 05:17:21,161 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:21,161 INFO L377 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-20 05:17:21,162 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:21,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:21,572 INFO L237 Elim1Store]: Index analysis took 353 ms [2019-11-20 05:17:21,665 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:21,665 INFO L377 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-20 05:17:21,666 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:21,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:21,907 INFO L237 Elim1Store]: Index analysis took 211 ms [2019-11-20 05:17:21,959 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:21,959 INFO L377 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-20 05:17:21,960 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:22,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:22,296 INFO L237 Elim1Store]: Index analysis took 300 ms [2019-11-20 05:17:22,344 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:22,345 INFO L377 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-20 05:17:22,345 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:22,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:23,289 INFO L237 Elim1Store]: Index analysis took 884 ms [2019-11-20 05:17:23,450 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-20 05:17:23,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:23,451 INFO L377 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-20 05:17:23,452 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:23,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:23,612 INFO L237 Elim1Store]: Index analysis took 121 ms [2019-11-20 05:17:23,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:23,663 INFO L377 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-20 05:17:23,664 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:27,510 WARN L191 SmtUtils]: Spent 3.85 s on a formula simplification. DAG size of input: 301 DAG size of output: 262 [2019-11-20 05:17:27,511 INFO L567 ElimStorePlain]: treesize reduction 498, result has 60.0 percent of original size [2019-11-20 05:17:27,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:27,660 INFO L237 Elim1Store]: Index analysis took 124 ms [2019-11-20 05:17:27,697 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:27,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:27,726 INFO L377 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-20 05:17:27,727 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:27,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:27,981 INFO L237 Elim1Store]: Index analysis took 226 ms [2019-11-20 05:17:28,043 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:28,070 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:28,070 INFO L377 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-20 05:17:28,071 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:28,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:28,248 INFO L237 Elim1Store]: Index analysis took 150 ms [2019-11-20 05:17:28,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:28,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:28,323 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:28,324 INFO L377 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-20 05:17:28,324 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:28,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:28,461 INFO L237 Elim1Store]: Index analysis took 117 ms [2019-11-20 05:17:28,490 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:28,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:28,552 INFO L377 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-20 05:17:28,553 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:28,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:28,656 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 05:17:28,682 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:28,682 INFO L377 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-20 05:17:28,683 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-20 05:17:31,995 WARN L191 SmtUtils]: Spent 3.31 s on a formula simplification. DAG size of input: 304 DAG size of output: 271 [2019-11-20 05:17:31,995 INFO L567 ElimStorePlain]: treesize reduction 159, result has 82.5 percent of original size [2019-11-20 05:17:31,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:31,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:31,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:31,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:31,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,002 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-20 05:17:32,002 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 39 variables, input treesize:1251, output treesize:751 [2019-11-20 05:17:32,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:32,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:44,531 WARN L191 SmtUtils]: Spent 5.74 s on a formula simplification. DAG size of input: 390 DAG size of output: 170 [2019-11-20 05:17:44,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:44,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:50,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:50,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:56,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:56,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:56,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:56,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:56,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:17:56,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:17:57,045 INFO L237 Elim1Store]: Index analysis took 904 ms [2019-11-20 05:17:57,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:17:57,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 225 treesize of output 151 [2019-11-20 05:17:57,065 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-20 05:17:57,223 INFO L343 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2019-11-20 05:17:57,223 INFO L377 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 3 case distinctions, treesize of input 205 treesize of output 127 [2019-11-20 05:17:57,224 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-20 05:19:43,235 WARN L191 SmtUtils]: Spent 1.77 m on a formula simplification. DAG size of input: 187 DAG size of output: 160 [2019-11-20 05:19:43,235 INFO L567 ElimStorePlain]: treesize reduction 146, result has 78.4 percent of original size [2019-11-20 05:19:43,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 05:19:44,909 INFO L237 Elim1Store]: Index analysis took 1488 ms [2019-11-20 05:19:44,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 05:19:44,916 INFO L377 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 201 treesize of output 123 [2019-11-20 05:19:44,917 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-20 05:19:46,250 INFO L237 Elim1Store]: Index analysis took 337 ms [2019-11-20 05:19:46,283 INFO L343 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2019-11-20 05:19:46,283 INFO L377 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 221 treesize of output 147 [2019-11-20 05:19:46,284 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-20 05:20:01,613 WARN L191 SmtUtils]: Spent 15.33 s on a formula simplification. DAG size of input: 147 DAG size of output: 118 [2019-11-20 05:20:01,614 INFO L567 ElimStorePlain]: treesize reduction 138, result has 60.7 percent of original size [2019-11-20 05:20:01,618 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-20 05:20:01,618 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 25 variables, input treesize:857, output treesize:137 [2019-11-20 05:20:04,498 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-11-20 05:20:05,915 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 05:20:07,964 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 05:20:08,160 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-20 05:20:08,160 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 05:20:46,775 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-20 05:21:07,727 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-20 05:21:20,769 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 05:21:20,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 05:21:20,970 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.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-20 05:21:20,974 INFO L168 Benchmark]: Toolchain (without parser) took 515982.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 961.8 MB in the beginning and 1.1 GB in the end (delta: -181.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:20,974 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:21:20,975 INFO L168 Benchmark]: CACSL2BoogieTranslator took 435.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -188.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:20,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:20,975 INFO L168 Benchmark]: Boogie Preprocessor took 80.11 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:20,975 INFO L168 Benchmark]: RCFGBuilder took 38051.19 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: 73.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2019-11-20 05:21:20,976 INFO L168 Benchmark]: TraceAbstraction took 477342.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -79.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:21:20,977 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 435.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 961.8 MB in the beginning and 1.2 GB in the end (delta: -188.6 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.11 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 38051.19 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: 73.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 477342.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -79.4 MB). There was no memory consumed. 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...