./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label20.c -s /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fa4a47a1f85495fa289be7c0278375d614571c4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label20.c -s /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fa4a47a1f85495fa289be7c0278375d614571c4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 09:49:41,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 09:49:41,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 09:49:41,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 09:49:41,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 09:49:41,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 09:49:41,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 09:49:41,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 09:49:41,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 09:49:41,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 09:49:41,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 09:49:41,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 09:49:41,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 09:49:41,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 09:49:41,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 09:49:41,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 09:49:41,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 09:49:41,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 09:49:41,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 09:49:41,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 09:49:41,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 09:49:41,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 09:49:41,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 09:49:41,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 09:49:41,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 09:49:41,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 09:49:41,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 09:49:41,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 09:49:41,276 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 09:49:41,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 09:49:41,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 09:49:41,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 09:49:41,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 09:49:41,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 09:49:41,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 09:49:41,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 09:49:41,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 09:49:41,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 09:49:41,281 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 09:49:41,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 09:49:41,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 09:49:41,283 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 09:49:41,300 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 09:49:41,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 09:49:41,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 09:49:41,301 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 09:49:41,301 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 09:49:41,301 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 09:49:41,301 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 09:49:41,301 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 09:49:41,301 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 09:49:41,301 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 09:49:41,301 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 09:49:41,301 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 09:49:41,302 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 09:49:41,302 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 09:49:41,302 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 09:49:41,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 09:49:41,302 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 09:49:41,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 09:49:41,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 09:49:41,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 09:49:41,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 09:49:41,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 09:49:41,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 09:49:41,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 09:49:41,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 09:49:41,304 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 09:49:41,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 09:49:41,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 09:49:41,305 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 09:49:41,305 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 09:49:41,305 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fa4a47a1f85495fa289be7c0278375d614571c4 [2020-12-09 09:49:41,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 09:49:41,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 09:49:41,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 09:49:41,507 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 09:49:41,508 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 09:49:41,508 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label20.c [2020-12-09 09:49:41,550 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data/a72554b96/dcf13d6418094a439a1b821c8c86e174/FLAG6d3517b9e [2020-12-09 09:49:41,992 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 09:49:41,993 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/sv-benchmarks/c/eca-rers2012/Problem14_label20.c [2020-12-09 09:49:42,005 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data/a72554b96/dcf13d6418094a439a1b821c8c86e174/FLAG6d3517b9e [2020-12-09 09:49:42,014 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data/a72554b96/dcf13d6418094a439a1b821c8c86e174 [2020-12-09 09:49:42,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 09:49:42,017 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 09:49:42,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 09:49:42,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 09:49:42,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 09:49:42,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,023 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ab784b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42, skipping insertion in model container [2020-12-09 09:49:42,023 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 09:49:42,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 09:49:42,218 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/sv-benchmarks/c/eca-rers2012/Problem14_label20.c[6130,6143] [2020-12-09 09:49:42,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 09:49:42,335 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 09:49:42,353 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/sv-benchmarks/c/eca-rers2012/Problem14_label20.c[6130,6143] [2020-12-09 09:49:42,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 09:49:42,421 INFO L208 MainTranslator]: Completed translation [2020-12-09 09:49:42,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42 WrapperNode [2020-12-09 09:49:42,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 09:49:42,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 09:49:42,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 09:49:42,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 09:49:42,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,452 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 09:49:42,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 09:49:42,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 09:49:42,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 09:49:42,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... [2020-12-09 09:49:42,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 09:49:42,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 09:49:42,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 09:49:42,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 09:49:42,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 09:49:42,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 09:49:42,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 09:49:42,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 09:49:42,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 09:49:53,717 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 09:49:53,717 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 09:49:53,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:49:53 BoogieIcfgContainer [2020-12-09 09:49:53,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 09:49:53,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 09:49:53,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 09:49:53,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 09:49:53,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:49:42" (1/3) ... [2020-12-09 09:49:53,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2099eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:49:53, skipping insertion in model container [2020-12-09 09:49:53,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:49:42" (2/3) ... [2020-12-09 09:49:53,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2099eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:49:53, skipping insertion in model container [2020-12-09 09:49:53,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:49:53" (3/3) ... [2020-12-09 09:49:53,724 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label20.c [2020-12-09 09:49:53,734 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 09:49:53,736 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 09:49:53,743 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 09:49:53,758 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 09:49:53,758 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 09:49:53,758 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 09:49:53,758 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 09:49:53,758 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 09:49:53,759 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 09:49:53,759 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 09:49:53,759 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 09:49:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 09:49:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 09:49:53,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:49:53,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 09:49:53,770 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:49:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:49:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1037753167, now seen corresponding path program 1 times [2020-12-09 09:49:53,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 09:49:53,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437471927] [2020-12-09 09:49:53,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 09:49:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:49:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:49:53,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437471927] [2020-12-09 09:49:53,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:49:53,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 09:49:53,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071393337] [2020-12-09 09:49:53,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:49:53,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 09:49:53,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:49:53,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:49:53,924 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 09:49:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:49:53,979 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 09:49:53,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:49:53,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 09:49:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:49:53,986 INFO L225 Difference]: With dead ends: 23 [2020-12-09 09:49:53,986 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 09:49:53,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:49:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 09:49:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 09:49:54,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 09:49:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 09:49:54,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 09:49:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:49:54,009 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 09:49:54,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:49:54,009 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 09:49:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 09:49:54,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:49:54,010 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 09:49:54,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 09:49:54,010 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:49:54,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:49:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash 355347175, now seen corresponding path program 1 times [2020-12-09 09:49:54,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 09:49:54,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211856757] [2020-12-09 09:49:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 09:49:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:49:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:49:54,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211856757] [2020-12-09 09:49:54,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305084236] [2020-12-09 09:49:54,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 09:49:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:49:54,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 09:49:54,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:49:54,682 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 1337 DAG size of output: 72 [2020-12-09 09:49:54,712 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 1] term [2020-12-09 09:49:54,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 09:49:54,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 1] term [2020-12-09 09:49:54,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 09:49:54,716 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 5, 2, 5, 2, 5, 1] term [2020-12-09 09:49:54,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 09:49:54,717 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 5, 2, 5, 1] term [2020-12-09 09:49:54,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 09:49:54,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 5, 1] term [2020-12-09 09:49:54,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 09:49:54,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-12-09 09:49:54,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 09:49:54,721 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 1] term [2020-12-09 09:49:54,722 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2020-12-09 09:49:54,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 4, 1] term [2020-12-09 09:49:54,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 09:49:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:49:54,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:49:55,162 WARN L197 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 2616 DAG size of output: 1593 [2020-12-09 09:49:55,221 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 10, 6, 10, 6, 7, 3, 8, 4, 9, 6, 8, 4, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,222 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,229 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 10, 6, 10, 6, 7, 3, 8, 4, 9, 6, 8, 4, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,229 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,236 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 7, 3, 8, 4, 9, 6, 8, 4, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,236 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,243 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 7, 3, 8, 4, 9, 6, 8, 4, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,244 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,250 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 7, 3, 8, 4, 9, 6, 8, 4, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,250 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,257 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 9, 6, 8, 4, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,257 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,264 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 6, 8, 4, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,265 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,271 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,272 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,278 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 6, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,278 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,284 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,285 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,291 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,291 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,297 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 7, 5, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,298 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,304 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,304 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,311 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,311 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,317 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,317 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,322 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,323 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,328 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,329 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,334 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 6, 2, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,335 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,343 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,343 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,349 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,349 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,355 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,355 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,360 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,361 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,367 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,367 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,373 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,373 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,379 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,380 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,385 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,386 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,391 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,392 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,397 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,398 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,403 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 6, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,404 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,409 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,409 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,414 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,414 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,418 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 7, 6, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,419 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,423 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,423 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,428 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,428 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,432 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,432 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,436 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,437 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,440 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,440 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,443 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,443 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,446 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,446 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,449 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,449 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,452 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,452 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,455 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,455 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,457 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 6, 5, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,458 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,462 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,462 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,464 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,464 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,489 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,490 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,493 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,493 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,496 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,496 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,499 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,499 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,502 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,502 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,504 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,505 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,507 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,507 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,510 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,510 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,513 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,513 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,516 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,516 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,518 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,518 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,520 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,521 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,523 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,523 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,525 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,526 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,528 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,528 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,530 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,530 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,532 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 7, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,532 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,534 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,534 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,536 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,536 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,538 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,538 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,540 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 6, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,540 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,542 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,542 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,544 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,545 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,547 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,547 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,549 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 7, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,549 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,550 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 8, 4, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,550 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,552 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,552 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,553 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,554 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,555 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 5, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,555 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,556 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 10, 6, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,556 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,558 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 6, 2, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,558 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,561 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 6, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,561 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,562 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 7, 6, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,562 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,563 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 7, 4, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,563 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,564 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,564 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,565 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 9, 6, 3, 2, 1] term [2020-12-09 09:49:55,565 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,582 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 9, 6, 9, 6, 6, 3, 6, 4, 8, 6, 7, 4, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,583 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,587 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 9, 6, 6, 3, 6, 4, 8, 6, 7, 4, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,587 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,590 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 6, 3, 6, 4, 8, 6, 7, 4, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,590 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,594 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 6, 3, 6, 4, 8, 6, 7, 4, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,594 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,597 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 6, 3, 6, 4, 8, 6, 7, 4, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,598 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,601 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 6, 4, 8, 6, 7, 4, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,601 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,604 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 4, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,604 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,607 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,608 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,611 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,611 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,614 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,614 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,617 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,618 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,621 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 6, 5, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,621 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,624 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,624 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,627 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,627 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,630 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,631 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,633 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,634 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,637 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,637 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,640 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,640 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,644 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,644 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,647 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,647 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,650 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,650 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,653 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,653 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,655 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,655 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,657 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,658 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,660 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,660 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,662 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,662 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,664 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,665 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,667 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,667 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,669 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,669 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,671 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,671 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,673 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,673 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,675 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 6, 6, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,675 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,677 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 6, 4, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,677 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,680 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,680 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,683 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,683 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,686 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,686 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,688 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,688 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,690 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,690 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,692 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,692 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,694 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,694 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,696 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,696 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,697 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,698 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,700 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 5, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,700 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,701 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,702 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,703 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,703 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,705 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,705 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,706 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,707 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,708 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,708 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,710 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,710 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,711 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,711 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,713 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,713 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,714 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,714 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,716 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,716 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,717 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,717 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,719 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,719 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,720 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,720 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,721 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,722 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,723 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,723 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,724 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,724 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,726 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,726 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,727 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,727 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,728 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 6, 3, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,728 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,729 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,730 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,731 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,731 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,733 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,733 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,734 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,735 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,736 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,736 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,737 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,738 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,739 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,739 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,741 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 6, 3, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,741 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,742 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,742 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,743 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,744 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,744 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,744 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,745 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,745 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,746 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,746 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,747 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,747 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,748 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,748 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,749 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,749 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,749 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 4, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,750 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,750 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 6, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,750 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,751 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 3, 2, 1] term [2020-12-09 09:49:55,751 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,761 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 22, 6, 7, 6, 9, 6, 11, 6, 7, 6, 5, 4, 8, 6, 8, 5, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,761 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,764 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 9, 6, 11, 6, 7, 6, 5, 4, 8, 6, 8, 5, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,765 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,765 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,766 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,769 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 11, 6, 7, 6, 5, 4, 8, 6, 8, 5, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,770 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,770 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,770 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,772 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 6, 7, 6, 5, 4, 8, 6, 8, 5, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,772 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,774 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 5, 4, 8, 6, 8, 5, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,774 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,774 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,774 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,776 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 4, 8, 6, 8, 5, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,776 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,778 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 5, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,778 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,779 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,780 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,782 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 15, 6, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,782 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,783 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,783 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,787 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 6, 6, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,787 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,788 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,789 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,790 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,790 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,791 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,791 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,794 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 20, 6, 3, 4, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,794 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,796 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,796 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,797 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,797 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,798 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,798 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,799 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,799 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,800 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,800 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,800 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,800 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,801 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,801 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,802 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,802 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,803 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:49:55,803 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,803 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,803 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,804 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,804 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,805 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,805 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,805 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,805 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,806 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,806 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,807 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:49:55,807 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,808 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,808 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,809 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,809 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,810 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,810 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,811 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,812 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,812 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,812 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,813 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,813 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,813 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,814 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,814 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,814 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,815 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,815 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,815 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,815 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,816 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,816 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,817 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,817 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,817 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,817 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,818 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,818 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,818 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,819 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,819 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,819 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,820 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,820 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,820 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,820 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,821 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,821 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,821 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,822 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,822 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,822 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,823 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,823 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,823 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,823 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,824 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,824 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,824 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,825 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,825 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,825 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,825 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,826 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,826 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,826 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,827 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,827 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,827 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,827 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,828 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,828 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,828 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 09:49:55,828 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,829 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,829 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,829 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 09:49:55,830 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:55,830 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:49:55,830 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:49:57,487 WARN L197 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 563 DAG size of output: 105 [2020-12-09 09:49:58,033 WARN L197 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 88 [2020-12-09 09:49:58,040 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 6, 6, 4, 5, 4, 4, 4, 1] term [2020-12-09 09:49:58,040 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-12-09 09:49:58,225 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-12-09 09:49:58,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:49:58,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1431604321] [2020-12-09 09:49:58,244 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 09:49:58,244 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 09:49:58,248 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 09:49:58,252 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 09:49:58,253 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 09:49:58,365 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 55 [2020-12-09 09:49:58,842 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 55 [2020-12-09 09:49:59,726 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 2465 DAG size of output: 2324 [2020-12-09 09:50:14,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 09:50:14,387 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: variable got div captured at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:319) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:190) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminate(DualJunctionDer.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:776) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:739) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:656) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:151) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1133) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 09:50:14,400 INFO L168 Benchmark]: Toolchain (without parser) took 32378.65 ms. Allocated memory was 117.4 MB in the beginning and 641.7 MB in the end (delta: 524.3 MB). Free memory was 79.0 MB in the beginning and 489.7 MB in the end (delta: -410.7 MB). Peak memory consumption was 481.2 MB. Max. memory is 16.1 GB. [2020-12-09 09:50:14,401 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 117.4 MB. Free memory is still 97.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 09:50:14,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.38 ms. Allocated memory is still 117.4 MB. Free memory was 78.9 MB in the beginning and 72.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 09:50:14,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.58 ms. Allocated memory is still 117.4 MB. Free memory was 72.9 MB in the beginning and 62.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-09 09:50:14,406 INFO L168 Benchmark]: Boogie Preprocessor took 53.85 ms. Allocated memory is still 117.4 MB. Free memory was 62.9 MB in the beginning and 56.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 09:50:14,409 INFO L168 Benchmark]: RCFGBuilder took 11165.43 ms. Allocated memory was 117.4 MB in the beginning and 369.1 MB in the end (delta: 251.7 MB). Free memory was 56.5 MB in the beginning and 223.2 MB in the end (delta: -166.7 MB). Peak memory consumption was 241.8 MB. Max. memory is 16.1 GB. [2020-12-09 09:50:14,411 INFO L168 Benchmark]: TraceAbstraction took 20674.96 ms. Allocated memory was 369.1 MB in the beginning and 641.7 MB in the end (delta: 272.6 MB). Free memory was 223.2 MB in the beginning and 489.7 MB in the end (delta: -266.5 MB). Peak memory consumption was 373.2 MB. Max. memory is 16.1 GB. [2020-12-09 09:50:14,415 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 117.4 MB. Free memory is still 97.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 403.38 ms. Allocated memory is still 117.4 MB. Free memory was 78.9 MB in the beginning and 72.9 MB in the end (delta: 6.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.58 ms. Allocated memory is still 117.4 MB. Free memory was 72.9 MB in the beginning and 62.9 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.85 ms. Allocated memory is still 117.4 MB. Free memory was 62.9 MB in the beginning and 56.5 MB in the end (delta: 6.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 11165.43 ms. Allocated memory was 117.4 MB in the beginning and 369.1 MB in the end (delta: 251.7 MB). Free memory was 56.5 MB in the beginning and 223.2 MB in the end (delta: -166.7 MB). Peak memory consumption was 241.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20674.96 ms. Allocated memory was 369.1 MB in the beginning and 641.7 MB in the end (delta: 272.6 MB). Free memory was 223.2 MB in the beginning and 489.7 MB in the end (delta: -266.5 MB). Peak memory consumption was 373.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: variable got div captured de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: variable got div captured: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 09:50:15,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 09:50:15,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 09:50:16,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 09:50:16,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 09:50:16,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 09:50:16,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 09:50:16,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 09:50:16,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 09:50:16,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 09:50:16,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 09:50:16,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 09:50:16,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 09:50:16,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 09:50:16,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 09:50:16,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 09:50:16,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 09:50:16,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 09:50:16,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 09:50:16,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 09:50:16,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 09:50:16,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 09:50:16,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 09:50:16,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 09:50:16,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 09:50:16,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 09:50:16,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 09:50:16,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 09:50:16,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 09:50:16,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 09:50:16,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 09:50:16,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 09:50:16,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 09:50:16,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 09:50:16,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 09:50:16,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 09:50:16,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 09:50:16,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 09:50:16,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 09:50:16,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 09:50:16,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 09:50:16,047 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 09:50:16,065 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 09:50:16,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 09:50:16,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 09:50:16,066 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 09:50:16,066 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 09:50:16,066 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 09:50:16,066 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 09:50:16,066 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 09:50:16,066 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 09:50:16,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 09:50:16,067 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 09:50:16,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 09:50:16,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 09:50:16,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 09:50:16,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 09:50:16,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 09:50:16,068 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 09:50:16,068 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 09:50:16,068 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 09:50:16,068 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 09:50:16,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 09:50:16,069 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 09:50:16,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 09:50:16,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 09:50:16,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 09:50:16,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 09:50:16,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 09:50:16,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 09:50:16,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 09:50:16,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 09:50:16,070 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 09:50:16,070 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 09:50:16,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 09:50:16,070 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 09:50:16,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 09:50:16,071 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fa4a47a1f85495fa289be7c0278375d614571c4 [2020-12-09 09:50:16,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 09:50:16,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 09:50:16,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 09:50:16,317 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 09:50:16,318 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 09:50:16,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label20.c [2020-12-09 09:50:16,365 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data/8405f8979/931a04ecea4447ea809a87e39ae67baf/FLAGac5404419 [2020-12-09 09:50:16,813 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 09:50:16,813 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/sv-benchmarks/c/eca-rers2012/Problem14_label20.c [2020-12-09 09:50:16,823 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data/8405f8979/931a04ecea4447ea809a87e39ae67baf/FLAGac5404419 [2020-12-09 09:50:16,833 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/data/8405f8979/931a04ecea4447ea809a87e39ae67baf [2020-12-09 09:50:16,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 09:50:16,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 09:50:16,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 09:50:16,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 09:50:16,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 09:50:16,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:50:16" (1/1) ... [2020-12-09 09:50:16,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d9ed34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:16, skipping insertion in model container [2020-12-09 09:50:16,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:50:16" (1/1) ... [2020-12-09 09:50:16,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 09:50:16,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 09:50:17,054 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/sv-benchmarks/c/eca-rers2012/Problem14_label20.c[6130,6143] [2020-12-09 09:50:17,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 09:50:17,230 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 09:50:17,258 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/sv-benchmarks/c/eca-rers2012/Problem14_label20.c[6130,6143] [2020-12-09 09:50:17,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 09:50:17,376 INFO L208 MainTranslator]: Completed translation [2020-12-09 09:50:17,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17 WrapperNode [2020-12-09 09:50:17,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 09:50:17,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 09:50:17,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 09:50:17,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 09:50:17,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 09:50:17,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 09:50:17,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 09:50:17,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 09:50:17,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... [2020-12-09 09:50:17,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 09:50:17,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 09:50:17,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 09:50:17,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 09:50:17,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 09:50:17,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 09:50:17,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 09:50:17,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 09:50:17,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 09:50:19,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 09:50:19,960 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 09:50:19,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:50:19 BoogieIcfgContainer [2020-12-09 09:50:19,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 09:50:19,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 09:50:19,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 09:50:19,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 09:50:19,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:50:16" (1/3) ... [2020-12-09 09:50:19,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0549d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:50:19, skipping insertion in model container [2020-12-09 09:50:19,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:17" (2/3) ... [2020-12-09 09:50:19,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0549d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:50:19, skipping insertion in model container [2020-12-09 09:50:19,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:50:19" (3/3) ... [2020-12-09 09:50:19,967 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem14_label20.c [2020-12-09 09:50:19,976 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 09:50:19,980 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 09:50:19,987 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 09:50:20,007 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 09:50:20,007 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 09:50:20,007 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 09:50:20,007 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 09:50:20,007 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 09:50:20,008 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 09:50:20,008 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 09:50:20,008 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 09:50:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2020-12-09 09:50:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-09 09:50:20,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:20,030 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:50:20,030 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:20,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash -634083006, now seen corresponding path program 1 times [2020-12-09 09:50:20,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:50:20,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187011118] [2020-12-09 09:50:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/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 [2020-12-09 09:50:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:20,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 09:50:20,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:50:20,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:50:20,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187011118] [2020-12-09 09:50:20,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:50:20,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 09:50:20,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047379840] [2020-12-09 09:50:20,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:50:20,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:50:20,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:50:20,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:20,230 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 3 states. [2020-12-09 09:50:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:50:23,283 INFO L93 Difference]: Finished difference Result 669 states and 1200 transitions. [2020-12-09 09:50:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:50:23,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-12-09 09:50:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:50:23,294 INFO L225 Difference]: With dead ends: 669 [2020-12-09 09:50:23,294 INFO L226 Difference]: Without dead ends: 360 [2020-12-09 09:50:23,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2020-12-09 09:50:23,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2020-12-09 09:50:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-09 09:50:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 534 transitions. [2020-12-09 09:50:23,339 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 534 transitions. Word has length 60 [2020-12-09 09:50:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:50:23,339 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 534 transitions. [2020-12-09 09:50:23,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:50:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 534 transitions. [2020-12-09 09:50:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-12-09 09:50:23,344 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:23,344 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:50:23,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 09:50:23,546 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash -872801096, now seen corresponding path program 1 times [2020-12-09 09:50:23,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:50:23,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754960778] [2020-12-09 09:50:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/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 [2020-12-09 09:50:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:23,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 09:50:23,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:50:23,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:50:23,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754960778] [2020-12-09 09:50:23,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:50:23,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 09:50:23,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599714171] [2020-12-09 09:50:23,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:50:23,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:50:23,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:50:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:23,817 INFO L87 Difference]: Start difference. First operand 360 states and 534 transitions. Second operand 3 states. [2020-12-09 09:50:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:50:26,855 INFO L93 Difference]: Finished difference Result 1076 states and 1598 transitions. [2020-12-09 09:50:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:50:26,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2020-12-09 09:50:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:50:26,860 INFO L225 Difference]: With dead ends: 1076 [2020-12-09 09:50:26,860 INFO L226 Difference]: Without dead ends: 718 [2020-12-09 09:50:26,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-12-09 09:50:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2020-12-09 09:50:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2020-12-09 09:50:26,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 945 transitions. [2020-12-09 09:50:26,885 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 945 transitions. Word has length 125 [2020-12-09 09:50:26,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:50:26,886 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 945 transitions. [2020-12-09 09:50:26,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:50:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 945 transitions. [2020-12-09 09:50:26,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-09 09:50:26,888 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:26,888 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:50:27,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 09:50:27,090 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1746065234, now seen corresponding path program 1 times [2020-12-09 09:50:27,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:50:27,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212063369] [2020-12-09 09:50:27,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/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 [2020-12-09 09:50:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:27,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 09:50:27,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:50:27,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:50:27,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212063369] [2020-12-09 09:50:27,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:50:27,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 09:50:27,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611498177] [2020-12-09 09:50:27,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:50:27,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:50:27,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:50:27,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:27,350 INFO L87 Difference]: Start difference. First operand 716 states and 945 transitions. Second operand 3 states. [2020-12-09 09:50:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:50:29,586 INFO L93 Difference]: Finished difference Result 1252 states and 1673 transitions. [2020-12-09 09:50:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:50:29,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2020-12-09 09:50:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:50:29,590 INFO L225 Difference]: With dead ends: 1252 [2020-12-09 09:50:29,590 INFO L226 Difference]: Without dead ends: 894 [2020-12-09 09:50:29,591 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2020-12-09 09:50:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 894. [2020-12-09 09:50:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 894 states. [2020-12-09 09:50:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1135 transitions. [2020-12-09 09:50:29,606 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1135 transitions. Word has length 129 [2020-12-09 09:50:29,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:50:29,606 INFO L481 AbstractCegarLoop]: Abstraction has 894 states and 1135 transitions. [2020-12-09 09:50:29,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:50:29,606 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1135 transitions. [2020-12-09 09:50:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-09 09:50:29,608 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:29,608 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:50:29,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 09:50:29,810 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -929954738, now seen corresponding path program 1 times [2020-12-09 09:50:29,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:50:29,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454406474] [2020-12-09 09:50:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/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 [2020-12-09 09:50:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:29,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 09:50:29,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:50:30,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:50:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:50:30,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454406474] [2020-12-09 09:50:30,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [423067127] [2020-12-09 09:50:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt [2020-12-09 09:50:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:30,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 09:50:30,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:50:30,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:50:30,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 09:50:30,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2020-12-09 09:50:30,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463241419] [2020-12-09 09:50:30,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 09:50:30,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:50:30,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 09:50:30,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-12-09 09:50:30,465 INFO L87 Difference]: Start difference. First operand 894 states and 1135 transitions. Second operand 4 states. [2020-12-09 09:50:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:50:40,775 INFO L93 Difference]: Finished difference Result 2022 states and 2764 transitions. [2020-12-09 09:50:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 09:50:40,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-09 09:50:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:50:40,783 INFO L225 Difference]: With dead ends: 2022 [2020-12-09 09:50:40,783 INFO L226 Difference]: Without dead ends: 1308 [2020-12-09 09:50:40,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-09 09:50:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2020-12-09 09:50:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1072. [2020-12-09 09:50:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-09 09:50:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1408 transitions. [2020-12-09 09:50:40,807 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1408 transitions. Word has length 140 [2020-12-09 09:50:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:50:40,808 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1408 transitions. [2020-12-09 09:50:40,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 09:50:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1408 transitions. [2020-12-09 09:50:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2020-12-09 09:50:40,811 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:40,811 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:50:41,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt [2020-12-09 09:50:41,214 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:41,216 INFO L82 PathProgramCache]: Analyzing trace with hash -169875344, now seen corresponding path program 1 times [2020-12-09 09:50:41,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:50:41,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561451960] [2020-12-09 09:50:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/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 [2020-12-09 09:50:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:41,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-09 09:50:41,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2020-12-09 09:50:41,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:50:41,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561451960] [2020-12-09 09:50:41,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:50:41,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 09:50:41,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69488112] [2020-12-09 09:50:41,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 09:50:41,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:50:41,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 09:50:41,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 09:50:41,583 INFO L87 Difference]: Start difference. First operand 1072 states and 1408 transitions. Second operand 4 states. [2020-12-09 09:50:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:50:43,611 INFO L93 Difference]: Finished difference Result 1993 states and 2653 transitions. [2020-12-09 09:50:43,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 09:50:43,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 301 [2020-12-09 09:50:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:50:43,616 INFO L225 Difference]: With dead ends: 1993 [2020-12-09 09:50:43,616 INFO L226 Difference]: Without dead ends: 1072 [2020-12-09 09:50:43,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-09 09:50:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2020-12-09 09:50:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2020-12-09 09:50:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-09 09:50:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1398 transitions. [2020-12-09 09:50:43,631 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1398 transitions. Word has length 301 [2020-12-09 09:50:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:50:43,631 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 1398 transitions. [2020-12-09 09:50:43,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 09:50:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1398 transitions. [2020-12-09 09:50:43,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2020-12-09 09:50:43,635 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:43,636 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:50:43,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 09:50:43,836 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash 637616723, now seen corresponding path program 1 times [2020-12-09 09:50:43,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:50:43,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668138538] [2020-12-09 09:50:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/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 [2020-12-09 09:50:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:43,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 09:50:43,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2020-12-09 09:50:44,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:50:44,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668138538] [2020-12-09 09:50:44,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:50:44,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 09:50:44,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543940633] [2020-12-09 09:50:44,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:50:44,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:50:44,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:50:44,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:44,166 INFO L87 Difference]: Start difference. First operand 1072 states and 1398 transitions. Second operand 3 states. [2020-12-09 09:50:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:50:47,026 INFO L93 Difference]: Finished difference Result 2676 states and 3587 transitions. [2020-12-09 09:50:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:50:47,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2020-12-09 09:50:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:50:47,032 INFO L225 Difference]: With dead ends: 2676 [2020-12-09 09:50:47,033 INFO L226 Difference]: Without dead ends: 1784 [2020-12-09 09:50:47,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2020-12-09 09:50:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1784. [2020-12-09 09:50:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2020-12-09 09:50:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2214 transitions. [2020-12-09 09:50:47,063 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2214 transitions. Word has length 340 [2020-12-09 09:50:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:50:47,063 INFO L481 AbstractCegarLoop]: Abstraction has 1784 states and 2214 transitions. [2020-12-09 09:50:47,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:50:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2214 transitions. [2020-12-09 09:50:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2020-12-09 09:50:47,066 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:47,067 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:50:47,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 09:50:47,267 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:47,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1417879851, now seen corresponding path program 1 times [2020-12-09 09:50:47,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:50:47,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711022755] [2020-12-09 09:50:47,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/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 [2020-12-09 09:50:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:47,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 09:50:47,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 629 proven. 135 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-12-09 09:50:47,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:50:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-12-09 09:50:48,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711022755] [2020-12-09 09:50:48,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 09:50:48,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 09:50:48,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923375297] [2020-12-09 09:50:48,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:50:48,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:50:48,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:50:48,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 09:50:48,617 INFO L87 Difference]: Start difference. First operand 1784 states and 2214 transitions. Second operand 3 states. [2020-12-09 09:50:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:50:55,118 INFO L93 Difference]: Finished difference Result 3922 states and 5044 transitions. [2020-12-09 09:50:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:50:55,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 500 [2020-12-09 09:50:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:50:55,127 INFO L225 Difference]: With dead ends: 3922 [2020-12-09 09:50:55,127 INFO L226 Difference]: Without dead ends: 2496 [2020-12-09 09:50:55,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 994 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 09:50:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2020-12-09 09:50:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2318. [2020-12-09 09:50:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2020-12-09 09:50:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2851 transitions. [2020-12-09 09:50:55,158 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2851 transitions. Word has length 500 [2020-12-09 09:50:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:50:55,158 INFO L481 AbstractCegarLoop]: Abstraction has 2318 states and 2851 transitions. [2020-12-09 09:50:55,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:50:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2851 transitions. [2020-12-09 09:50:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2020-12-09 09:50:55,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:55,163 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:50:55,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 09:50:55,365 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1711800515, now seen corresponding path program 1 times [2020-12-09 09:50:55,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:50:55,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622920752] [2020-12-09 09:50:55,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 09:50:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:55,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 09:50:55,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 422 proven. 277 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2020-12-09 09:50:56,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:50:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 670 proven. 29 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2020-12-09 09:50:58,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622920752] [2020-12-09 09:50:58,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1581064088] [2020-12-09 09:50:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt [2020-12-09 09:50:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:58,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 09:50:58,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2020-12-09 09:50:59,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:50:59,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 09:50:59,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4] total 11 [2020-12-09 09:50:59,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166819265] [2020-12-09 09:50:59,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 09:50:59,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:50:59,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 09:50:59,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-09 09:50:59,123 INFO L87 Difference]: Start difference. First operand 2318 states and 2851 transitions. Second operand 6 states. [2020-12-09 09:51:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:51:02,111 INFO L93 Difference]: Finished difference Result 4352 states and 5415 transitions. [2020-12-09 09:51:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 09:51:02,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 528 [2020-12-09 09:51:02,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:51:02,119 INFO L225 Difference]: With dead ends: 4352 [2020-12-09 09:51:02,119 INFO L226 Difference]: Without dead ends: 2318 [2020-12-09 09:51:02,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1581 GetRequests, 1571 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-09 09:51:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2020-12-09 09:51:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2020-12-09 09:51:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2020-12-09 09:51:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2519 transitions. [2020-12-09 09:51:02,147 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2519 transitions. Word has length 528 [2020-12-09 09:51:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:51:02,148 INFO L481 AbstractCegarLoop]: Abstraction has 2318 states and 2519 transitions. [2020-12-09 09:51:02,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 09:51:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2519 transitions. [2020-12-09 09:51:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2020-12-09 09:51:02,152 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:51:02,153 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:51:02,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt [2020-12-09 09:51:02,555 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:51:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:51:02,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1279279130, now seen corresponding path program 1 times [2020-12-09 09:51:02,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:51:02,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139864193] [2020-12-09 09:51:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-09 09:51:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:51:02,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 09:51:02,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:51:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 683 proven. 420 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2020-12-09 09:51:03,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:51:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 1103 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2020-12-09 09:51:05,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139864193] [2020-12-09 09:51:05,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 09:51:05,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 09:51:05,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007979729] [2020-12-09 09:51:05,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:51:05,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:51:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:51:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 09:51:05,142 INFO L87 Difference]: Start difference. First operand 2318 states and 2519 transitions. Second operand 3 states. [2020-12-09 09:51:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:51:07,688 INFO L93 Difference]: Finished difference Result 4812 states and 5292 transitions. [2020-12-09 09:51:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:51:07,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 688 [2020-12-09 09:51:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:51:07,698 INFO L225 Difference]: With dead ends: 4812 [2020-12-09 09:51:07,698 INFO L226 Difference]: Without dead ends: 2852 [2020-12-09 09:51:07,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1374 GetRequests, 1370 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 09:51:07,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2020-12-09 09:51:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2020-12-09 09:51:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2020-12-09 09:51:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3121 transitions. [2020-12-09 09:51:07,731 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3121 transitions. Word has length 688 [2020-12-09 09:51:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:51:07,732 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 3121 transitions. [2020-12-09 09:51:07,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:51:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3121 transitions. [2020-12-09 09:51:07,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2020-12-09 09:51:07,738 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:51:07,739 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:51:07,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-09 09:51:07,940 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:51:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:51:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1351120615, now seen corresponding path program 1 times [2020-12-09 09:51:07,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:51:07,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982878134] [2020-12-09 09:51:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 09:51:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:51:08,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 09:51:08,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:51:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 1126 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2020-12-09 09:51:08,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:51:08,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982878134] [2020-12-09 09:51:08,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:51:08,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 09:51:08,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100536049] [2020-12-09 09:51:08,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:51:08,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:51:08,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:51:08,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:51:08,796 INFO L87 Difference]: Start difference. First operand 2852 states and 3121 transitions. Second operand 3 states. [2020-12-09 09:51:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:51:10,497 INFO L93 Difference]: Finished difference Result 6236 states and 6895 transitions. [2020-12-09 09:51:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:51:10,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 786 [2020-12-09 09:51:10,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:51:10,515 INFO L225 Difference]: With dead ends: 6236 [2020-12-09 09:51:10,515 INFO L226 Difference]: Without dead ends: 3742 [2020-12-09 09:51:10,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 784 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:51:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2020-12-09 09:51:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2020-12-09 09:51:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3742 states. [2020-12-09 09:51:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4017 transitions. [2020-12-09 09:51:10,558 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4017 transitions. Word has length 786 [2020-12-09 09:51:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:51:10,558 INFO L481 AbstractCegarLoop]: Abstraction has 3742 states and 4017 transitions. [2020-12-09 09:51:10,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:51:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4017 transitions. [2020-12-09 09:51:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2020-12-09 09:51:10,566 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:51:10,566 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:51:10,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-09 09:51:10,767 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:51:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:51:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1567564187, now seen corresponding path program 1 times [2020-12-09 09:51:10,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:51:10,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457576913] [2020-12-09 09:51:10,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-09 09:51:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:51:11,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-09 09:51:11,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:51:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2378 backedges. 1445 proven. 420 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2020-12-09 09:51:14,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:51:15,328 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 6, 1] term [2020-12-09 09:51:15,328 INFO L639 QuantifierPusher]: Distributing 6 disjuncts over 7 conjuncts [2020-12-09 09:51:18,129 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2020-12-09 09:51:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2378 backedges. 1865 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2020-12-09 09:51:20,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457576913] [2020-12-09 09:51:20,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 09:51:20,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2020-12-09 09:51:20,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128686985] [2020-12-09 09:51:20,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 09:51:20,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:51:20,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 09:51:20,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2020-12-09 09:51:20,657 INFO L87 Difference]: Start difference. First operand 3742 states and 4017 transitions. Second operand 11 states. [2020-12-09 09:51:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:51:24,497 INFO L93 Difference]: Finished difference Result 7290 states and 7840 transitions. [2020-12-09 09:51:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 09:51:24,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 886 [2020-12-09 09:51:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:51:24,516 INFO L225 Difference]: With dead ends: 7290 [2020-12-09 09:51:24,516 INFO L226 Difference]: Without dead ends: 3897 [2020-12-09 09:51:24,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1770 GetRequests, 1707 SyntacticMatches, 45 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=146, Invalid=234, Unknown=0, NotChecked=0, Total=380 [2020-12-09 09:51:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2020-12-09 09:51:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3897. [2020-12-09 09:51:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2020-12-09 09:51:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 4173 transitions. [2020-12-09 09:51:24,558 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 4173 transitions. Word has length 886 [2020-12-09 09:51:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:51:24,559 INFO L481 AbstractCegarLoop]: Abstraction has 3897 states and 4173 transitions. [2020-12-09 09:51:24,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 09:51:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 4173 transitions. [2020-12-09 09:51:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2020-12-09 09:51:24,567 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:51:24,567 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:51:24,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-09 09:51:24,768 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:51:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:51:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -105161947, now seen corresponding path program 1 times [2020-12-09 09:51:24,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:51:24,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78733878] [2020-12-09 09:51:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-09 09:51:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:51:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 09:51:25,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:51:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2969 backedges. 463 proven. 2135 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-12-09 09:51:26,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:51:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2969 backedges. 1943 proven. 82 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-09 09:51:27,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78733878] [2020-12-09 09:51:27,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1773148475] [2020-12-09 09:51:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt [2020-12-09 09:51:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:51:28,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 09:51:28,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:51:28,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 09:51:28,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 09:51:28,908 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 09:51:28,913 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 09:51:28,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 09:51:28,918 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 09:51:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2969 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 2506 trivial. 0 not checked. [2020-12-09 09:51:29,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:51:29,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 09:51:29,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 5] total 15 [2020-12-09 09:51:29,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608036856] [2020-12-09 09:51:29,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 09:51:29,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:51:29,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 09:51:29,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-12-09 09:51:29,507 INFO L87 Difference]: Start difference. First operand 3897 states and 4173 transitions. Second operand 7 states. [2020-12-09 09:51:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:51:32,508 INFO L93 Difference]: Finished difference Result 7886 states and 8526 transitions. [2020-12-09 09:51:32,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 09:51:32,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 963 [2020-12-09 09:51:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:51:32,520 INFO L225 Difference]: With dead ends: 7886 [2020-12-09 09:51:32,521 INFO L226 Difference]: Without dead ends: 3897 [2020-12-09 09:51:32,523 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2888 GetRequests, 2873 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-12-09 09:51:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2020-12-09 09:51:32,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3897. [2020-12-09 09:51:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2020-12-09 09:51:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 4159 transitions. [2020-12-09 09:51:32,563 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 4159 transitions. Word has length 963 [2020-12-09 09:51:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:51:32,563 INFO L481 AbstractCegarLoop]: Abstraction has 3897 states and 4159 transitions. [2020-12-09 09:51:32,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 09:51:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 4159 transitions. [2020-12-09 09:51:32,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2020-12-09 09:51:32,571 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:51:32,571 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 09:51:32,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt,15 mathsat -unsat_core_generation=3 [2020-12-09 09:51:32,973 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:51:32,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:51:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash 344279414, now seen corresponding path program 1 times [2020-12-09 09:51:32,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:51:32,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791357939] [2020-12-09 09:51:32,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2020-12-09 09:51:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:51:33,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 09:51:33,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:51:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2999 backedges. 463 proven. 2165 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2020-12-09 09:51:34,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:51:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2999 backedges. 1967 proven. 88 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2020-12-09 09:51:36,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791357939] [2020-12-09 09:51:36,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1700271644] [2020-12-09 09:51:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt [2020-12-09 09:51:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:51:36,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 09:51:36,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:51:37,243 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 09:51:37,243 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 09:51:37,243 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 09:51:37,245 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 09:51:37,248 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 09:51:37,248 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 09:51:37,250 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 09:51:37,252 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 09:51:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2999 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 2536 trivial. 0 not checked. [2020-12-09 09:51:37,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:51:37,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 09:51:37,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 5] total 15 [2020-12-09 09:51:37,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942296097] [2020-12-09 09:51:37,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 09:51:37,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:51:37,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 09:51:37,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-12-09 09:51:37,912 INFO L87 Difference]: Start difference. First operand 3897 states and 4159 transitions. Second operand 7 states. [2020-12-09 09:51:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:51:40,885 INFO L93 Difference]: Finished difference Result 8661 states and 9334 transitions. [2020-12-09 09:51:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 09:51:40,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 969 [2020-12-09 09:51:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:51:40,888 INFO L225 Difference]: With dead ends: 8661 [2020-12-09 09:51:40,888 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 09:51:40,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2906 GetRequests, 2891 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-12-09 09:51:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 09:51:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 09:51:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 09:51:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 09:51:40,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 969 [2020-12-09 09:51:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:51:40,893 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 09:51:40,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 09:51:40,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 09:51:40,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 09:51:41,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3,18 cvc4 --incremental --print-success --lang smt [2020-12-09 09:51:41,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 09:51:41,597 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-12-09 09:51:41,739 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L762(lines 762 880) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L895(line 895) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L829(lines 829 880) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L631(lines 631 880) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L565(lines 565 880) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L698(lines 698 880) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L500(lines 500 880) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L369(lines 369 880) no Hoare annotation was computed. [2020-12-09 09:51:41,741 INFO L262 CegarLoopResult]: For program point L303(lines 303 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L436(lines 436 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L239(lines 239 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L768(lines 768 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L636(lines 636 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L835(lines 835 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L571(lines 571 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L505(lines 505 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L704(lines 704 880) no Hoare annotation was computed. [2020-12-09 09:51:41,742 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L309(lines 309 880) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L442(lines 442 880) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L376(lines 376 880) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L245(lines 245 880) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L774(lines 774 880) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L642(lines 642 880) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L510(lines 510 880) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L841(lines 841 880) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,743 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L710(lines 710 880) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L578(lines 578 880) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L315(lines 315 880) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L448(lines 448 880) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L382(lines 382 880) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L251(lines 251 880) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L648(lines 648 880) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L516(lines 516 880) no Hoare annotation was computed. [2020-12-09 09:51:41,744 INFO L262 CegarLoopResult]: For program point L847(lines 847 880) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L781(lines 781 880) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L583(lines 583 880) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L716(lines 716 880) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L321(lines 321 880) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L454(lines 454 880) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L388(lines 388 880) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L257(lines 257 880) no Hoare annotation was computed. [2020-12-09 09:51:41,745 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L852(lines 852 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L654(lines 654 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L522(lines 522 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L787(lines 787 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L589(lines 589 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L722(lines 722 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L459(lines 459 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L327(lines 327 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L394(lines 394 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L262(lines 262 880) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,746 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L858(lines 858 880) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 194) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L660(lines 660 880) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L528(lines 528 880) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L793(lines 793 880) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L595(lines 595 880) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L728(lines 728 880) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L464(lines 464 880) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 09:51:41,747 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L333(lines 333 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L400(lines 400 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L268(lines 268 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L864(lines 864 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L666(lines 666 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L534(lines 534 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L799(lines 799 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L601(lines 601 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L734(lines 734 880) no Hoare annotation was computed. [2020-12-09 09:51:41,748 INFO L262 CegarLoopResult]: For program point L470(lines 470 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L339(lines 339 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L406(lines 406 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L274(lines 274 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L869(lines 869 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L672(lines 672 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L540(lines 540 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L805(lines 805 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L607(lines 607 880) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,749 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L740(lines 740 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L477(lines 477 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L345(lines 345 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L279(lines 279 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L412(lines 412 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L875(lines 875 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L678(lines 678 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L546(lines 546 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L811(lines 811 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L745(lines 745 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L613(lines 613 880) no Hoare annotation was computed. [2020-12-09 09:51:41,750 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L482(lines 482 880) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L351(lines 351 880) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L285(lines 285 880) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L418(lines 418 880) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L258 CegarLoopResult]: At program point L881(lines 30 882) the Hoare annotation is: (let ((.cse0 (or (not (= (_ bv8 32) ~a15~0)) (not (bvslt (_ bv80 32) ~a12~0)))) (.cse1 (= (_ bv1 32) ~a24~0)) (.cse2 (not (= (_ bv6 32) ~a15~0)))) (or (and .cse0 (= (_ bv9 32) ~a21~0)) (and .cse0 (or (not (bvsle ~a12~0 (_ bv4294967253 32))) (not .cse1))) (and .cse1 .cse2) (and .cse2 (= (_ bv8 32) ~a21~0)))) [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L551(lines 551 880) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L221(lines 221 880) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 09:51:41,751 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L684(lines 684 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L817(lines 817 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L751(lines 751 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L619(lines 619 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L265 CegarLoopResult]: At program point L884(lines 884 900) the Hoare annotation is: true [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L488(lines 488 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L290(lines 290 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L687(lines 687 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L357(lines 357 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L424(lines 424 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L557(lines 557 880) no Hoare annotation was computed. [2020-12-09 09:51:41,752 INFO L262 CegarLoopResult]: For program point L227(lines 227 880) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L757(lines 757 880) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L625(lines 625 880) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L824(lines 824 880) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L258 CegarLoopResult]: At program point L890-2(lines 890 899) the Hoare annotation is: (let ((.cse0 (or (not (= (_ bv8 32) ~a15~0)) (not (bvslt (_ bv80 32) ~a12~0)))) (.cse1 (= (_ bv1 32) ~a24~0)) (.cse2 (not (= (_ bv6 32) ~a15~0)))) (or (and .cse0 (= (_ bv9 32) ~a21~0)) (and .cse0 (or (not (bvsle ~a12~0 (_ bv4294967253 32))) (not .cse1))) (and .cse1 .cse2) (and .cse2 (= (_ bv8 32) ~a21~0)))) [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L494(lines 494 880) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L296(lines 296 880) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L693(lines 693 880) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L363(lines 363 880) no Hoare annotation was computed. [2020-12-09 09:51:41,753 INFO L262 CegarLoopResult]: For program point L562(lines 562 880) no Hoare annotation was computed. [2020-12-09 09:51:41,754 INFO L262 CegarLoopResult]: For program point L430(lines 430 880) no Hoare annotation was computed. [2020-12-09 09:51:41,754 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,754 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,754 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 882) no Hoare annotation was computed. [2020-12-09 09:51:41,754 INFO L262 CegarLoopResult]: For program point L233(lines 233 880) no Hoare annotation was computed. [2020-12-09 09:51:41,754 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 09:51:41,754 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 09:51:41,754 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 09:51:41,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:51:41 BoogieIcfgContainer [2020-12-09 09:51:41,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 09:51:41,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 09:51:41,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 09:51:41,765 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 09:51:41,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:50:19" (3/4) ... [2020-12-09 09:51:41,768 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 09:51:41,784 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 09:51:41,785 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 09:51:41,786 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 09:51:41,788 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 09:51:41,875 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_73d9fc4a-1e8a-4391-bf5a-0dc152d30190/bin/utaipan/witness.graphml [2020-12-09 09:51:41,876 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 09:51:41,876 INFO L168 Benchmark]: Toolchain (without parser) took 85040.19 ms. Allocated memory was 52.4 MB in the beginning and 524.3 MB in the end (delta: 471.9 MB). Free memory was 28.4 MB in the beginning and 276.7 MB in the end (delta: -248.4 MB). Peak memory consumption was 222.7 MB. Max. memory is 16.1 GB. [2020-12-09 09:51:41,877 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 52.4 MB. Free memory was 35.2 MB in the beginning and 35.1 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 09:51:41,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.54 ms. Allocated memory was 52.4 MB in the beginning and 79.7 MB in the end (delta: 27.3 MB). Free memory was 28.2 MB in the beginning and 59.2 MB in the end (delta: -31.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 16.1 GB. [2020-12-09 09:51:41,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.95 ms. Allocated memory is still 79.7 MB. Free memory was 59.2 MB in the beginning and 52.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 09:51:41,877 INFO L168 Benchmark]: Boogie Preprocessor took 59.85 ms. Allocated memory is still 79.7 MB. Free memory was 52.6 MB in the beginning and 47.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 09:51:41,878 INFO L168 Benchmark]: RCFGBuilder took 2445.84 ms. Allocated memory was 79.7 MB in the beginning and 96.5 MB in the end (delta: 16.8 MB). Free memory was 47.0 MB in the beginning and 56.6 MB in the end (delta: -9.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 16.1 GB. [2020-12-09 09:51:41,878 INFO L168 Benchmark]: TraceAbstraction took 81801.83 ms. Allocated memory was 96.5 MB in the beginning and 524.3 MB in the end (delta: 427.8 MB). Free memory was 55.9 MB in the beginning and 295.6 MB in the end (delta: -239.6 MB). Peak memory consumption was 189.2 MB. Max. memory is 16.1 GB. [2020-12-09 09:51:41,878 INFO L168 Benchmark]: Witness Printer took 110.55 ms. Allocated memory is still 524.3 MB. Free memory was 295.6 MB in the beginning and 276.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-12-09 09:51:41,880 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 52.4 MB. Free memory was 35.2 MB in the beginning and 35.1 MB in the end (delta: 71.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 540.54 ms. Allocated memory was 52.4 MB in the beginning and 79.7 MB in the end (delta: 27.3 MB). Free memory was 28.2 MB in the beginning and 59.2 MB in the end (delta: -31.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.95 ms. Allocated memory is still 79.7 MB. Free memory was 59.2 MB in the beginning and 52.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.85 ms. Allocated memory is still 79.7 MB. Free memory was 52.6 MB in the beginning and 47.4 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2445.84 ms. Allocated memory was 79.7 MB in the beginning and 96.5 MB in the end (delta: 16.8 MB). Free memory was 47.0 MB in the beginning and 56.6 MB in the end (delta: -9.6 MB). Peak memory consumption was 30.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 81801.83 ms. Allocated memory was 96.5 MB in the beginning and 524.3 MB in the end (delta: 427.8 MB). Free memory was 55.9 MB in the beginning and 295.6 MB in the end (delta: -239.6 MB). Peak memory consumption was 189.2 MB. Max. memory is 16.1 GB. * Witness Printer took 110.55 ms. Allocated memory is still 524.3 MB. Free memory was 295.6 MB in the beginning and 276.7 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 194]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((!(8bv32 == a15) || !~bvslt32(80bv32, a12)) && 9bv32 == a21) || ((!(8bv32 == a15) || !~bvslt32(80bv32, a12)) && (!~bvsle32(a12, 4294967253bv32) || !(1bv32 == a24)))) || (1bv32 == a24 && !(6bv32 == a15))) || (!(6bv32 == a15) && 8bv32 == a21) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((!(8bv32 == a15) || !~bvslt32(80bv32, a12)) && 9bv32 == a21) || ((!(8bv32 == a15) || !~bvslt32(80bv32, a12)) && (!~bvsle32(a12, 4294967253bv32) || !(1bv32 == a24)))) || (1bv32 == a24 && !(6bv32 == a15))) || (!(6bv32 == a15) && 8bv32 == a21) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 81.2s, OverallIterations: 13, TraceHistogramMax: 9, AutomataDifference: 47.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1678 SDtfs, 3413 SDslu, 130 SDs, 0 SdLazy, 9509 SolverSat, 1172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13671 GetRequests, 13545 SyntacticMatches, 50 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3897occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 416 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 81 NumberOfFragments, 99 HoareAnnotationTreeSize, 3 FomulaSimplifications, 3172 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 404 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 26.3s InterpolantComputationTime, 9015 NumberOfCodeBlocks, 9015 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 13665 ConstructedInterpolants, 0 QuantifiedInterpolants, 54222723 SizeOfPredicates, 34 NumberOfNonLiveVariables, 10267 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 26963/32772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...