/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:01:06,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:01:06,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:01:06,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:01:06,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:01:06,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:01:06,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:01:06,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:01:06,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:01:06,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:01:06,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:01:06,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:01:06,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:01:06,766 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:01:06,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:01:06,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:01:06,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:01:06,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:01:06,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:01:06,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:01:06,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:01:06,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:01:06,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:01:06,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:01:06,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:01:06,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:01:06,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:01:06,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:01:06,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:01:06,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:01:06,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:01:06,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:01:06,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:01:06,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:01:06,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:01:06,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:01:06,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:01:06,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:01:06,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:01:06,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:01:06,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:01:06,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 05:01:06,817 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:01:06,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:01:06,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:01:06,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:01:06,819 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:01:06,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:01:06,819 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:01:06,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:01:06,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:01:06,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:01:06,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:01:06,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:01:06,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:01:06,820 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:01:06,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:01:06,821 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:01:06,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:01:06,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:01:06,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:01:06,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:01:06,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:01:06,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:01:06,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:01:06,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:01:06,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:01:06,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:01:06,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:01:06,823 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:01:06,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:01:07,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:01:07,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:01:07,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:01:07,131 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:01:07,133 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:01:07,134 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc.i [2020-10-16 05:01:07,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d19f4d6b/2acccd97b6944765a67bd74e268831cb/FLAG3fd3e01be [2020-10-16 05:01:07,782 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:01:07,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc.i [2020-10-16 05:01:07,803 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d19f4d6b/2acccd97b6944765a67bd74e268831cb/FLAG3fd3e01be [2020-10-16 05:01:08,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d19f4d6b/2acccd97b6944765a67bd74e268831cb [2020-10-16 05:01:08,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:01:08,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:01:08,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:01:08,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:01:08,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:01:08,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:01:08" (1/1) ... [2020-10-16 05:01:08,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:08, skipping insertion in model container [2020-10-16 05:01:08,095 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:01:08" (1/1) ... [2020-10-16 05:01:08,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:01:08,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:01:08,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:01:08,825 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:01:08,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:01:09,051 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:01:09,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09 WrapperNode [2020-10-16 05:01:09,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:01:09,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:01:09,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:01:09,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:01:09,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:01:09,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:01:09,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:01:09,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:01:09,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... [2020-10-16 05:01:09,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:01:09,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:01:09,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:01:09,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:01:09,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-16 05:01:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:01:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:01:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:01:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:01:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:01:09,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:01:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:01:09,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:01:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:01:09,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:01:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:01:09,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:01:09,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:01:09,324 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 05:01:12,542 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:01:12,543 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:01:12,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:01:12 BoogieIcfgContainer [2020-10-16 05:01:12,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:01:12,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:01:12,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:01:12,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:01:12,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:01:08" (1/3) ... [2020-10-16 05:01:12,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc225a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:01:12, skipping insertion in model container [2020-10-16 05:01:12,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:01:09" (2/3) ... [2020-10-16 05:01:12,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc225a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:01:12, skipping insertion in model container [2020-10-16 05:01:12,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:01:12" (3/3) ... [2020-10-16 05:01:12,553 INFO L111 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc.i [2020-10-16 05:01:12,564 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:01:12,572 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:01:12,573 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:01:12,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,607 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,607 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,607 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,608 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,611 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,625 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,635 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,656 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,657 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,658 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,658 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,659 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,660 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:01:12,681 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:01:12,701 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:01:12,701 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:01:12,701 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:01:12,702 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:01:12,702 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:01:12,702 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:01:12,702 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:01:12,702 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:01:12,715 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 05:01:12,754 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 05:01:12,755 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:12,759 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:01:12,760 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 05:01:12,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 189 flow [2020-10-16 05:01:12,768 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:01:12,771 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 189 flow [2020-10-16 05:01:12,773 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 189 flow [2020-10-16 05:01:12,774 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 189 flow [2020-10-16 05:01:12,795 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 05:01:12,795 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:12,796 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:01:12,798 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 05:01:12,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:12,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:12,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:12,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:12,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:12,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:12,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:12,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:13,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:13,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:13,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 05:01:13,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:13,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:13,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:14,163 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 05:01:14,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 05:01:14,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:14,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:14,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,374 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-16 05:01:15,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:15,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:15,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:01:15,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:15,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:15,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:15,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:15,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:15,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:15,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:15,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:15,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:15,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:15,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:15,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:15,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:15,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:15,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:15,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:15,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:15,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:15,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:15,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:16,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:16,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:16,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:16,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:16,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:16,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:16,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:16,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:16,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:16,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:16,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:16,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:16,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:16,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:16,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:16,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:16,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:16,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:16,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:16,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:16,876 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:01:17,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:17,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:17,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:17,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:17,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:17,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:17,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:17,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:17,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:17,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:17,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:17,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:17,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:17,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:17,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:01:17,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:17,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:17,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:17,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:17,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:17,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:17,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:17,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:17,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:17,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:17,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:17,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:17,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:17,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:17,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:17,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:17,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:17,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:17,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:17,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:17,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:17,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:17,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:17,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:17,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:17,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:17,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:17,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:01:17,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:17,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:17,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:18,422 WARN L193 SmtUtils]: Spent 974.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 175 [2020-10-16 05:01:18,926 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 96 [2020-10-16 05:01:19,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:19,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:01:19,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:19,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:19,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:19,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:19,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 05:01:19,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:19,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:19,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:01:19,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:19,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:19,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:19,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:19,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:01:19,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:01:19,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:01:19,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:19,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:01:19,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:19,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:19,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 4, 3, 2, 2, 1] term [2020-10-16 05:01:19,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:19,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:19,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:19,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:19,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:19,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:19,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:19,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:19,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:19,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:19,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:19,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:19,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:19,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:01:19,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:19,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:19,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:19,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:19,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:19,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:19,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:19,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:19,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:19,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:19,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:19,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:19,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:19,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:19,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:19,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:01:19,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:20,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:20,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:20,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:20,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:20,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:20,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:20,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 4, 3, 2, 2, 1] term [2020-10-16 05:01:20,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:20,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:20,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:20,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:20,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:20,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:20,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:20,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:20,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:20,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:20,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:20,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:20,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:20,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:20,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:21,833 WARN L193 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-16 05:01:22,134 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 05:01:22,765 WARN L193 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-16 05:01:23,066 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-16 05:01:23,720 WARN L193 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2020-10-16 05:01:24,023 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-16 05:01:24,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,152 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:01:24,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:24,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:24,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:24,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:24,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:01:24,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:24,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:01:24,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:24,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:24,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:24,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:01:24,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:24,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:24,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:24,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:24,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:24,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:24,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:24,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:24,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:24,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:24,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:24,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:24,916 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 05:01:25,222 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2020-10-16 05:01:25,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:25,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:25,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:25,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:25,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:25,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:25,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:25,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:25,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:01:25,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:25,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:25,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-16 05:01:25,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-16 05:01:25,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:25,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-16 05:01:25,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-16 05:01:25,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-10-16 05:01:25,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-10-16 05:01:25,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:25,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 1] term [2020-10-16 05:01:25,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:25,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:25,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 2, 1] term [2020-10-16 05:01:25,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 4, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 4, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:25,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:25,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:25,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:25,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:25,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:25,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:25,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:25,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:25,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:25,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:25,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:25,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:25,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:25,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:25,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:25,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:25,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:25,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:25,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:25,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:25,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 4, 7, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:25,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 4, 7, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:25,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:25,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:25,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:25,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:25,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:25,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:25,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:25,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:25,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:25,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:25,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:26,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:26,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:26,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:26,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:26,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:26,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:26,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:26,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:26,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:26,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,520 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 05:01:26,821 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 05:01:26,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:26,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:26,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:26,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:26,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:26,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:26,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:26,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:26,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:26,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:26,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:26,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:26,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:27,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 4, 7, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 4, 7, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:27,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:27,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:27,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:27,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:27,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:27,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:27,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:27,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 2, 1] term [2020-10-16 05:01:27,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 4, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 6, 4, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:27,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:27,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:27,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:01:27,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:27,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:27,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 6, 3, 4, 3, 4, 3, 2, 2, 1] term [2020-10-16 05:01:27,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:27,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:27,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:27,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:27,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:27,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,299 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:27,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:27,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 4, 7, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 4, 7, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:27,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:27,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:27,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:27,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:27,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:27,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:27,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:27,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:27,918 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 05:01:28,030 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 05:01:28,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:28,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:28,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:28,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:28,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:28,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:28,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:01:28,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 4, 7, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:28,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 4, 7, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:01:28,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:28,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:28,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:28,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:01:28,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:01:28,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:28,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:01:28,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:28,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:28,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:28,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:28,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:28,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:28,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:28,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:01:28,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:28,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:28,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:01:28,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:01:28,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:01:28,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:01:28,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:01:28,222 INFO L132 LiptonReduction]: Checked pairs total: 4321 [2020-10-16 05:01:28,222 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 05:01:28,225 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15459 [2020-10-16 05:01:28,230 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2020-10-16 05:01:28,230 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:28,230 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:28,231 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 05:01:28,231 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1687516, now seen corresponding path program 1 times [2020-10-16 05:01:28,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:28,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113498110] [2020-10-16 05:01:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:28,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113498110] [2020-10-16 05:01:28,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:28,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:01:28,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370853332] [2020-10-16 05:01:28,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:01:28,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:28,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:01:28,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:01:28,463 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 170 [2020-10-16 05:01:28,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states. [2020-10-16 05:01:28,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:28,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 170 [2020-10-16 05:01:28,467 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:28,637 INFO L129 PetriNetUnfolder]: 161/293 cut-off events. [2020-10-16 05:01:28,637 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:01:28,639 INFO L80 FinitePrefix]: Finished finitePrefix Result has 561 conditions, 293 events. 161/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1362 event pairs, 130 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 551. Up to 193 conditions per place. [2020-10-16 05:01:28,642 INFO L132 encePairwiseOnDemand]: 167/170 looper letters, 13 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2020-10-16 05:01:28,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 101 flow [2020-10-16 05:01:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:01:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:01:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2020-10-16 05:01:28,659 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2020-10-16 05:01:28,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2020-10-16 05:01:28,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2020-10-16 05:01:28,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:28,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2020-10-16 05:01:28,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:01:28,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:01:28,677 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:01:28,679 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 420 transitions. [2020-10-16 05:01:28,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 101 flow [2020-10-16 05:01:28,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:01:28,687 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2020-10-16 05:01:28,690 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2020-10-16 05:01:28,690 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 05:01:28,690 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2020-10-16 05:01:28,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:01:28,690 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:28,691 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:28,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:01:28,691 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:28,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1641134890, now seen corresponding path program 1 times [2020-10-16 05:01:28,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:28,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335227544] [2020-10-16 05:01:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:28,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335227544] [2020-10-16 05:01:28,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:28,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:01:28,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994916263] [2020-10-16 05:01:28,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:01:28,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:01:28,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:01:28,791 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 170 [2020-10-16 05:01:28,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states. [2020-10-16 05:01:28,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:28,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 170 [2020-10-16 05:01:28,792 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:28,878 INFO L129 PetriNetUnfolder]: 110/215 cut-off events. [2020-10-16 05:01:28,878 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-16 05:01:28,879 INFO L80 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 215 events. 110/215 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 963 event pairs, 86 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 418. Up to 176 conditions per place. [2020-10-16 05:01:28,881 INFO L132 encePairwiseOnDemand]: 166/170 looper letters, 10 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2020-10-16 05:01:28,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 88 flow [2020-10-16 05:01:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:01:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:01:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2020-10-16 05:01:28,885 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7980392156862746 [2020-10-16 05:01:28,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2020-10-16 05:01:28,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2020-10-16 05:01:28,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:28,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2020-10-16 05:01:28,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:01:28,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:01:28,889 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:01:28,889 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 407 transitions. [2020-10-16 05:01:28,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 88 flow [2020-10-16 05:01:28,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:28,890 INFO L241 Difference]: Finished difference. Result has 31 places, 23 transitions, 67 flow [2020-10-16 05:01:28,890 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2020-10-16 05:01:28,891 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 05:01:28,891 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2020-10-16 05:01:28,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:01:28,891 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:28,891 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:28,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:01:28,892 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash -228279541, now seen corresponding path program 1 times [2020-10-16 05:01:28,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:28,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180509345] [2020-10-16 05:01:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:28,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180509345] [2020-10-16 05:01:28,991 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:28,991 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:01:28,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54830857] [2020-10-16 05:01:28,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:01:28,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:28,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:01:28,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:01:28,994 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 170 [2020-10-16 05:01:28,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states. [2020-10-16 05:01:28,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:28,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 170 [2020-10-16 05:01:28,994 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:29,016 INFO L129 PetriNetUnfolder]: 2/28 cut-off events. [2020-10-16 05:01:29,016 INFO L130 PetriNetUnfolder]: For 5/11 co-relation queries the response was YES. [2020-10-16 05:01:29,017 INFO L80 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 28 events. 2/28 cut-off events. For 5/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 43. Up to 8 conditions per place. [2020-10-16 05:01:29,017 INFO L132 encePairwiseOnDemand]: 167/170 looper letters, 1 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2020-10-16 05:01:29,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 75 flow [2020-10-16 05:01:29,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:01:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:01:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2020-10-16 05:01:29,020 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8725490196078431 [2020-10-16 05:01:29,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2020-10-16 05:01:29,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2020-10-16 05:01:29,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:29,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2020-10-16 05:01:29,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:01:29,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:01:29,023 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:01:29,024 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 445 transitions. [2020-10-16 05:01:29,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 75 flow [2020-10-16 05:01:29,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:01:29,025 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 75 flow [2020-10-16 05:01:29,025 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2020-10-16 05:01:29,025 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2020-10-16 05:01:29,025 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 75 flow [2020-10-16 05:01:29,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:01:29,026 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:29,026 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:29,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:01:29,026 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:29,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash 663392526, now seen corresponding path program 1 times [2020-10-16 05:01:29,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:29,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875885532] [2020-10-16 05:01:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:29,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875885532] [2020-10-16 05:01:29,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:29,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:01:29,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52136701] [2020-10-16 05:01:29,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:01:29,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:29,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:01:29,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:01:29,083 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 170 [2020-10-16 05:01:29,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 75 flow. Second operand 3 states. [2020-10-16 05:01:29,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:29,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 170 [2020-10-16 05:01:29,084 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:29,098 INFO L129 PetriNetUnfolder]: 2/28 cut-off events. [2020-10-16 05:01:29,098 INFO L130 PetriNetUnfolder]: For 22/30 co-relation queries the response was YES. [2020-10-16 05:01:29,098 INFO L80 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 28 events. 2/28 cut-off events. For 22/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 46. Up to 8 conditions per place. [2020-10-16 05:01:29,099 INFO L132 encePairwiseOnDemand]: 167/170 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2020-10-16 05:01:29,099 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 81 flow [2020-10-16 05:01:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:01:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:01:29,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2020-10-16 05:01:29,102 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8607843137254902 [2020-10-16 05:01:29,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2020-10-16 05:01:29,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2020-10-16 05:01:29,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:29,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2020-10-16 05:01:29,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:01:29,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:01:29,105 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:01:29,105 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 75 flow. Second operand 3 states and 439 transitions. [2020-10-16 05:01:29,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 81 flow [2020-10-16 05:01:29,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 75 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:29,106 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 77 flow [2020-10-16 05:01:29,107 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2020-10-16 05:01:29,107 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2020-10-16 05:01:29,107 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 77 flow [2020-10-16 05:01:29,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:01:29,107 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:29,107 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:29,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:01:29,108 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash -416962319, now seen corresponding path program 1 times [2020-10-16 05:01:29,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:29,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3649473] [2020-10-16 05:01:29,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:29,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3649473] [2020-10-16 05:01:29,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:29,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:01:29,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412629621] [2020-10-16 05:01:29,180 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:01:29,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:01:29,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:01:29,181 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 170 [2020-10-16 05:01:29,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 77 flow. Second operand 4 states. [2020-10-16 05:01:29,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:29,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 170 [2020-10-16 05:01:29,184 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:29,240 INFO L129 PetriNetUnfolder]: 58/124 cut-off events. [2020-10-16 05:01:29,240 INFO L130 PetriNetUnfolder]: For 126/136 co-relation queries the response was YES. [2020-10-16 05:01:29,241 INFO L80 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 124 events. 58/124 cut-off events. For 126/136 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 442 event pairs, 14 based on Foata normal form. 4/123 useless extension candidates. Maximal degree in co-relation 270. Up to 85 conditions per place. [2020-10-16 05:01:29,242 INFO L132 encePairwiseOnDemand]: 165/170 looper letters, 9 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2020-10-16 05:01:29,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 30 transitions, 119 flow [2020-10-16 05:01:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:01:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:01:29,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2020-10-16 05:01:29,245 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8 [2020-10-16 05:01:29,245 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2020-10-16 05:01:29,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2020-10-16 05:01:29,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:29,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2020-10-16 05:01:29,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:01:29,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:01:29,248 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:01:29,248 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 77 flow. Second operand 4 states and 544 transitions. [2020-10-16 05:01:29,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 30 transitions, 119 flow [2020-10-16 05:01:29,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 115 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:29,251 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 104 flow [2020-10-16 05:01:29,251 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2020-10-16 05:01:29,251 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2020-10-16 05:01:29,251 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 104 flow [2020-10-16 05:01:29,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:01:29,251 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:29,252 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:29,252 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:01:29,252 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1822861946, now seen corresponding path program 1 times [2020-10-16 05:01:29,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:29,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037838278] [2020-10-16 05:01:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:29,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037838278] [2020-10-16 05:01:29,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:29,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:01:29,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441400655] [2020-10-16 05:01:29,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:01:29,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:29,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:01:29,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:01:29,366 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 170 [2020-10-16 05:01:29,367 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 104 flow. Second operand 4 states. [2020-10-16 05:01:29,367 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:29,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 170 [2020-10-16 05:01:29,367 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:29,571 INFO L129 PetriNetUnfolder]: 316/594 cut-off events. [2020-10-16 05:01:29,571 INFO L130 PetriNetUnfolder]: For 946/961 co-relation queries the response was YES. [2020-10-16 05:01:29,574 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 594 events. 316/594 cut-off events. For 946/961 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3103 event pairs, 82 based on Foata normal form. 41/627 useless extension candidates. Maximal degree in co-relation 1509. Up to 273 conditions per place. [2020-10-16 05:01:29,577 INFO L132 encePairwiseOnDemand]: 163/170 looper letters, 14 selfloop transitions, 6 changer transitions 8/41 dead transitions. [2020-10-16 05:01:29,578 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 208 flow [2020-10-16 05:01:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:01:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:01:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2020-10-16 05:01:29,581 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7764705882352941 [2020-10-16 05:01:29,581 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2020-10-16 05:01:29,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2020-10-16 05:01:29,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:29,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2020-10-16 05:01:29,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:01:29,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:01:29,585 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:01:29,585 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 104 flow. Second operand 4 states and 528 transitions. [2020-10-16 05:01:29,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 208 flow [2020-10-16 05:01:29,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:01:29,589 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 142 flow [2020-10-16 05:01:29,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2020-10-16 05:01:29,590 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2020-10-16 05:01:29,590 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 142 flow [2020-10-16 05:01:29,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:01:29,590 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:29,590 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:29,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:01:29,590 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1436096510, now seen corresponding path program 2 times [2020-10-16 05:01:29,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:29,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950449269] [2020-10-16 05:01:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:29,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950449269] [2020-10-16 05:01:29,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:29,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:01:29,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166613189] [2020-10-16 05:01:29,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:01:29,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:01:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:01:29,668 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 170 [2020-10-16 05:01:29,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 142 flow. Second operand 5 states. [2020-10-16 05:01:29,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:29,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 170 [2020-10-16 05:01:29,669 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:29,802 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1654] L851-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~y$r_buff1_thd0~0_311 256) 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_782 256) 0)) (.cse11 (= (mod v_~y$r_buff0_thd0~0_357 256) 0))) (let ((.cse10 (not .cse11)) (.cse7 (= (mod v_~weak$$choice2~0_294 256) 0)) (.cse5 (and .cse19 .cse11)) (.cse6 (and .cse18 .cse11)) (.cse20 (= (mod v_~y$w_buff0_used~0_960 256) 0))) (let ((.cse12 (or .cse5 .cse6 .cse20)) (.cse9 (not .cse20)) (.cse1 (not .cse7)) (.cse3 (or (not .cse19) .cse10)) (.cse4 (or (not .cse18) .cse10))) (and (let ((.cse0 (= v_~y$w_buff1_used~0_782 v_~y$w_buff1_used~0_781))) (or (and .cse0 .cse1) (and (let ((.cse2 (= (mod v_~y$w_buff0_used~0_959 256) 0))) (or (and (not .cse2) (= v_~y$w_buff1_used~0_781 0) .cse3 .cse4) (and (or .cse5 .cse6 .cse2) .cse0))) .cse7))) (= v_~y~0_491 v_~y$mem_tmp~0_121) (= v_~y$w_buff0~0_383 v_~y$w_buff0~0_382) (= v_~y$flush_delayed~0_175 0) (= v_~y$r_buff0_thd0~0_357 v_~y$r_buff0_thd0~0_356) (= v_~y$w_buff1~0_379 v_~y$w_buff1~0_378) (= v_~weak$$choice2~0_294 |v_ULTIMATE.start_main_#t~nondet76_76|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~y$r_buff1_thd0~0_311 v_~y$r_buff1_thd0~0_310) (let ((.cse8 (= v_~y$w_buff0_used~0_959 v_~y$w_buff0_used~0_960))) (or (and .cse1 .cse8) (and .cse7 (or (and .cse9 (or (and (= v_~y$w_buff0_used~0_959 0) .cse10) (and .cse8 .cse11))) (and .cse8 .cse12))))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~nondet75_80| v_~weak$$choice0~0_109) (let ((.cse13 (= v_~__unbuffered_p2_EAX~0_61 1)) (.cse14 (= v_~__unbuffered_p2_EBX~0_68 1)) (.cse15 (= v_~main$tmp_guard1~0_48 0)) (.cse16 (= v_~__unbuffered_p1_EAX~0_54 1))) (or (and (= v_~y~0_491 2) .cse13 .cse14 (= v_~y~0_491 v_~y~0_490) .cse12 .cse15 .cse16) (and .cse9 (let ((.cse17 (and .cse1 (= v_~y~0_490 v_~y$mem_tmp~0_121)))) (or (and (or (and .cse7 (= v_~y~0_490 v_~y$w_buff0~0_383)) .cse17) .cse13 .cse14 .cse15 .cse10 (= 2 v_~y$w_buff0~0_383) .cse16) (and .cse13 .cse14 (or .cse17 (and .cse7 (= v_~y~0_490 v_~y$w_buff1~0_379))) (= v_~y$w_buff1~0_379 2) .cse15 .cse11 .cse16))) .cse3 .cse4))))))) InVars {ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_76|, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_80|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_68, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$w_buff1~0=v_~y$w_buff1~0_379, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_357, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~y~0=v_~y~0_491, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_311, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_782} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_75|, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_959, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_131|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_137|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_62|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_121|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_64|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_125|, ~y$mem_tmp~0=v_~y$mem_tmp~0_121, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_131|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_64|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_117|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_125|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_62|, ~y$w_buff0~0=v_~y$w_buff0~0_382, ~y$flush_delayed~0=v_~y$flush_delayed~0_175, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~y~0=v_~y~0_490, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_68, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_117|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_105|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_52|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_58|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_129|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_62|, ~weak$$choice0~0=v_~weak$$choice0~0_109, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_121|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_127|, ~y$w_buff1~0=v_~y$w_buff1~0_378, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_70|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_105|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~weak$$choice2~0=v_~weak$$choice2~0_294, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_310, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, ULTIMATE.start_main_#t~nondet75, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][38], [Black: 125#(and (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_cnt~0 0)), Black: 126#(not (= ~__unbuffered_p2_EBX~0 1)), 33#L762true, 130#true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 38#L811true, P0Thread1of1ForFork0InUse, Black: 133#(= ~__unbuffered_p2_EAX~0 0), Black: 135#(and (= ~__unbuffered_p2_EAX~0 0) (< 0 (+ (div ~y$w_buff0_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))), 139#true, Black: 110#(and (<= ~__unbuffered_p2_EAX~0 0) (<= ~y$w_buff1~0 0)), 83#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 115#(<= ~__unbuffered_p2_EAX~0 0), Black: 120#(<= ~__unbuffered_p1_EAX~0 0), 94#P0EXITtrue]) [2020-10-16 05:01:29,802 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2020-10-16 05:01:29,803 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:01:29,803 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:01:29,803 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:01:29,817 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1654] L851-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~y$r_buff1_thd0~0_311 256) 0)) (.cse19 (= (mod v_~y$w_buff1_used~0_782 256) 0)) (.cse11 (= (mod v_~y$r_buff0_thd0~0_357 256) 0))) (let ((.cse10 (not .cse11)) (.cse7 (= (mod v_~weak$$choice2~0_294 256) 0)) (.cse5 (and .cse19 .cse11)) (.cse6 (and .cse18 .cse11)) (.cse20 (= (mod v_~y$w_buff0_used~0_960 256) 0))) (let ((.cse12 (or .cse5 .cse6 .cse20)) (.cse9 (not .cse20)) (.cse1 (not .cse7)) (.cse3 (or (not .cse19) .cse10)) (.cse4 (or (not .cse18) .cse10))) (and (let ((.cse0 (= v_~y$w_buff1_used~0_782 v_~y$w_buff1_used~0_781))) (or (and .cse0 .cse1) (and (let ((.cse2 (= (mod v_~y$w_buff0_used~0_959 256) 0))) (or (and (not .cse2) (= v_~y$w_buff1_used~0_781 0) .cse3 .cse4) (and (or .cse5 .cse6 .cse2) .cse0))) .cse7))) (= v_~y~0_491 v_~y$mem_tmp~0_121) (= v_~y$w_buff0~0_383 v_~y$w_buff0~0_382) (= v_~y$flush_delayed~0_175 0) (= v_~y$r_buff0_thd0~0_357 v_~y$r_buff0_thd0~0_356) (= v_~y$w_buff1~0_379 v_~y$w_buff1~0_378) (= v_~weak$$choice2~0_294 |v_ULTIMATE.start_main_#t~nondet76_76|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~y$r_buff1_thd0~0_311 v_~y$r_buff1_thd0~0_310) (let ((.cse8 (= v_~y$w_buff0_used~0_959 v_~y$w_buff0_used~0_960))) (or (and .cse1 .cse8) (and .cse7 (or (and .cse9 (or (and (= v_~y$w_buff0_used~0_959 0) .cse10) (and .cse8 .cse11))) (and .cse8 .cse12))))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~nondet75_80| v_~weak$$choice0~0_109) (let ((.cse13 (= v_~__unbuffered_p2_EAX~0_61 1)) (.cse14 (= v_~__unbuffered_p2_EBX~0_68 1)) (.cse15 (= v_~main$tmp_guard1~0_48 0)) (.cse16 (= v_~__unbuffered_p1_EAX~0_54 1))) (or (and (= v_~y~0_491 2) .cse13 .cse14 (= v_~y~0_491 v_~y~0_490) .cse12 .cse15 .cse16) (and .cse9 (let ((.cse17 (and .cse1 (= v_~y~0_490 v_~y$mem_tmp~0_121)))) (or (and (or (and .cse7 (= v_~y~0_490 v_~y$w_buff0~0_383)) .cse17) .cse13 .cse14 .cse15 .cse10 (= 2 v_~y$w_buff0~0_383) .cse16) (and .cse13 .cse14 (or .cse17 (and .cse7 (= v_~y~0_490 v_~y$w_buff1~0_379))) (= v_~y$w_buff1~0_379 2) .cse15 .cse11 .cse16))) .cse3 .cse4))))))) InVars {ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_76|, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_80|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_68, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$w_buff1~0=v_~y$w_buff1~0_379, ~y$w_buff0~0=v_~y$w_buff0~0_383, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_357, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~y~0=v_~y~0_491, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_311, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_782} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_75|, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_79|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_959, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_131|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_137|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_62|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_121|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_64|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_125|, ~y$mem_tmp~0=v_~y$mem_tmp~0_121, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_131|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_64|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_117|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_125|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_62|, ~y$w_buff0~0=v_~y$w_buff0~0_382, ~y$flush_delayed~0=v_~y$flush_delayed~0_175, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~y~0=v_~y~0_490, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_68, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_117|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_105|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_52|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_58|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_129|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_62|, ~weak$$choice0~0=v_~weak$$choice0~0_109, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_121|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_127|, ~y$w_buff1~0=v_~y$w_buff1~0_378, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_70|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_105|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_356, ~weak$$choice2~0=v_~weak$$choice2~0_294, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_310, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_781} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, ULTIMATE.start_main_#t~nondet75, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite94, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~ite91, ULTIMATE.start_main_#t~ite90, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#t~ite80, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][38], [Black: 125#(and (= ~__unbuffered_p2_EBX~0 0) (= ~__unbuffered_cnt~0 0)), Black: 126#(not (= ~__unbuffered_p2_EBX~0 1)), 130#true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, 38#L811true, P0Thread1of1ForFork0InUse, Black: 133#(= ~__unbuffered_p2_EAX~0 0), Black: 135#(and (= ~__unbuffered_p2_EAX~0 0) (< 0 (+ (div ~y$w_buff0_used~0 256) 1)) (= ~y~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))), 139#true, 11#P1EXITtrue, Black: 110#(and (<= ~__unbuffered_p2_EAX~0 0) (<= ~y$w_buff1~0 0)), 83#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 115#(<= ~__unbuffered_p2_EAX~0 0), Black: 120#(<= ~__unbuffered_p1_EAX~0 0), 94#P0EXITtrue]) [2020-10-16 05:01:29,817 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2020-10-16 05:01:29,817 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2020-10-16 05:01:29,818 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2020-10-16 05:01:29,818 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2020-10-16 05:01:29,820 INFO L129 PetriNetUnfolder]: 223/453 cut-off events. [2020-10-16 05:01:29,821 INFO L130 PetriNetUnfolder]: For 1526/1585 co-relation queries the response was YES. [2020-10-16 05:01:29,824 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 453 events. 223/453 cut-off events. For 1526/1585 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2570 event pairs, 56 based on Foata normal form. 49/453 useless extension candidates. Maximal degree in co-relation 1227. Up to 154 conditions per place. [2020-10-16 05:01:29,827 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 19 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2020-10-16 05:01:29,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 248 flow [2020-10-16 05:01:29,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:01:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:01:29,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2020-10-16 05:01:29,832 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7870588235294118 [2020-10-16 05:01:29,832 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2020-10-16 05:01:29,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2020-10-16 05:01:29,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:29,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2020-10-16 05:01:29,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:01:29,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:01:29,837 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:01:29,838 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 142 flow. Second operand 5 states and 669 transitions. [2020-10-16 05:01:29,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 248 flow [2020-10-16 05:01:29,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 238 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:29,946 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 189 flow [2020-10-16 05:01:29,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2020-10-16 05:01:29,948 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2020-10-16 05:01:29,948 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 189 flow [2020-10-16 05:01:29,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:01:29,948 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:29,949 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:29,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:01:29,949 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:29,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:29,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1381472382, now seen corresponding path program 1 times [2020-10-16 05:01:29,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:29,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178018695] [2020-10-16 05:01:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:30,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178018695] [2020-10-16 05:01:30,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:30,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:01:30,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910751863] [2020-10-16 05:01:30,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:01:30,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:01:30,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:01:30,144 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 170 [2020-10-16 05:01:30,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 189 flow. Second operand 6 states. [2020-10-16 05:01:30,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:30,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 170 [2020-10-16 05:01:30,145 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:30,696 INFO L129 PetriNetUnfolder]: 1199/1816 cut-off events. [2020-10-16 05:01:30,696 INFO L130 PetriNetUnfolder]: For 3078/3112 co-relation queries the response was YES. [2020-10-16 05:01:30,704 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 1816 events. 1199/1816 cut-off events. For 3078/3112 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8877 event pairs, 241 based on Foata normal form. 30/1815 useless extension candidates. Maximal degree in co-relation 5553. Up to 1261 conditions per place. [2020-10-16 05:01:30,715 INFO L132 encePairwiseOnDemand]: 159/170 looper letters, 26 selfloop transitions, 14 changer transitions 26/75 dead transitions. [2020-10-16 05:01:30,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 503 flow [2020-10-16 05:01:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:01:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:01:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions. [2020-10-16 05:01:30,719 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2020-10-16 05:01:30,719 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions. [2020-10-16 05:01:30,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions. [2020-10-16 05:01:30,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:30,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions. [2020-10-16 05:01:30,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:01:30,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:01:30,724 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:01:30,724 INFO L185 Difference]: Start difference. First operand has 46 places, 34 transitions, 189 flow. Second operand 7 states and 765 transitions. [2020-10-16 05:01:30,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 503 flow [2020-10-16 05:01:30,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:01:30,737 INFO L241 Difference]: Finished difference. Result has 55 places, 40 transitions, 275 flow [2020-10-16 05:01:30,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2020-10-16 05:01:30,738 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2020-10-16 05:01:30,738 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 275 flow [2020-10-16 05:01:30,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:01:30,738 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:30,739 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:30,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:01:30,739 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:30,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:30,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1404331782, now seen corresponding path program 2 times [2020-10-16 05:01:30,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:30,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609944021] [2020-10-16 05:01:30,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:30,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609944021] [2020-10-16 05:01:30,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:30,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:01:30,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705464588] [2020-10-16 05:01:30,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:01:30,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:30,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:01:30,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:01:30,944 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 170 [2020-10-16 05:01:30,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 275 flow. Second operand 7 states. [2020-10-16 05:01:30,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:30,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 170 [2020-10-16 05:01:30,945 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:31,802 INFO L129 PetriNetUnfolder]: 1521/2348 cut-off events. [2020-10-16 05:01:31,802 INFO L130 PetriNetUnfolder]: For 4993/5022 co-relation queries the response was YES. [2020-10-16 05:01:31,812 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8810 conditions, 2348 events. 1521/2348 cut-off events. For 4993/5022 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12161 event pairs, 125 based on Foata normal form. 46/2361 useless extension candidates. Maximal degree in co-relation 8784. Up to 1173 conditions per place. [2020-10-16 05:01:31,820 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 32 selfloop transitions, 7 changer transitions 37/84 dead transitions. [2020-10-16 05:01:31,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 713 flow [2020-10-16 05:01:31,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:01:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:01:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions. [2020-10-16 05:01:31,824 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6607843137254902 [2020-10-16 05:01:31,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 674 transitions. [2020-10-16 05:01:31,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions. [2020-10-16 05:01:31,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:31,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions. [2020-10-16 05:01:31,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:01:31,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:01:31,829 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:01:31,829 INFO L185 Difference]: Start difference. First operand has 55 places, 40 transitions, 275 flow. Second operand 6 states and 674 transitions. [2020-10-16 05:01:31,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 713 flow [2020-10-16 05:01:31,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 690 flow, removed 8 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:31,846 INFO L241 Difference]: Finished difference. Result has 60 places, 32 transitions, 231 flow [2020-10-16 05:01:31,846 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=60, PETRI_TRANSITIONS=32} [2020-10-16 05:01:31,846 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2020-10-16 05:01:31,846 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 32 transitions, 231 flow [2020-10-16 05:01:31,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:01:31,847 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:31,847 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:31,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:01:31,847 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:31,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash 185886195, now seen corresponding path program 1 times [2020-10-16 05:01:31,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:31,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198350728] [2020-10-16 05:01:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:32,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198350728] [2020-10-16 05:01:32,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:32,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:01:32,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983691964] [2020-10-16 05:01:32,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:01:32,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:01:32,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:01:32,202 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 170 [2020-10-16 05:01:32,203 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 32 transitions, 231 flow. Second operand 8 states. [2020-10-16 05:01:32,203 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:32,203 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 170 [2020-10-16 05:01:32,204 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:32,632 INFO L129 PetriNetUnfolder]: 301/599 cut-off events. [2020-10-16 05:01:32,632 INFO L130 PetriNetUnfolder]: For 2496/2528 co-relation queries the response was YES. [2020-10-16 05:01:32,636 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2427 conditions, 599 events. 301/599 cut-off events. For 2496/2528 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3379 event pairs, 25 based on Foata normal form. 25/615 useless extension candidates. Maximal degree in co-relation 2409. Up to 276 conditions per place. [2020-10-16 05:01:32,639 INFO L132 encePairwiseOnDemand]: 162/170 looper letters, 17 selfloop transitions, 17 changer transitions 0/48 dead transitions. [2020-10-16 05:01:32,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 394 flow [2020-10-16 05:01:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:01:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:01:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 795 transitions. [2020-10-16 05:01:32,643 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6680672268907563 [2020-10-16 05:01:32,643 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 795 transitions. [2020-10-16 05:01:32,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 795 transitions. [2020-10-16 05:01:32,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:32,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 795 transitions. [2020-10-16 05:01:32,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:01:32,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:01:32,648 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:01:32,649 INFO L185 Difference]: Start difference. First operand has 60 places, 32 transitions, 231 flow. Second operand 7 states and 795 transitions. [2020-10-16 05:01:32,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 394 flow [2020-10-16 05:01:32,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 341 flow, removed 9 selfloop flow, removed 11 redundant places. [2020-10-16 05:01:32,655 INFO L241 Difference]: Finished difference. Result has 54 places, 42 transitions, 314 flow [2020-10-16 05:01:32,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=314, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2020-10-16 05:01:32,656 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2020-10-16 05:01:32,656 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 314 flow [2020-10-16 05:01:32,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:01:32,656 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:32,656 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:32,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:01:32,657 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash -818603790, now seen corresponding path program 1 times [2020-10-16 05:01:32,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:32,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597993260] [2020-10-16 05:01:32,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:32,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597993260] [2020-10-16 05:01:32,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:32,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:01:32,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954827411] [2020-10-16 05:01:32,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:01:32,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:32,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:01:32,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:01:32,938 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 170 [2020-10-16 05:01:32,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 314 flow. Second operand 7 states. [2020-10-16 05:01:32,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:32,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 170 [2020-10-16 05:01:32,939 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:33,263 INFO L129 PetriNetUnfolder]: 308/668 cut-off events. [2020-10-16 05:01:33,263 INFO L130 PetriNetUnfolder]: For 1936/1965 co-relation queries the response was YES. [2020-10-16 05:01:33,267 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2758 conditions, 668 events. 308/668 cut-off events. For 1936/1965 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4300 event pairs, 64 based on Foata normal form. 29/675 useless extension candidates. Maximal degree in co-relation 2743. Up to 256 conditions per place. [2020-10-16 05:01:33,270 INFO L132 encePairwiseOnDemand]: 161/170 looper letters, 13 selfloop transitions, 20 changer transitions 2/49 dead transitions. [2020-10-16 05:01:33,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 433 flow [2020-10-16 05:01:33,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:01:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:01:33,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 706 transitions. [2020-10-16 05:01:33,273 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.692156862745098 [2020-10-16 05:01:33,274 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 706 transitions. [2020-10-16 05:01:33,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 706 transitions. [2020-10-16 05:01:33,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:33,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 706 transitions. [2020-10-16 05:01:33,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:01:33,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:01:33,278 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:01:33,278 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 314 flow. Second operand 6 states and 706 transitions. [2020-10-16 05:01:33,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 433 flow [2020-10-16 05:01:33,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:01:33,283 INFO L241 Difference]: Finished difference. Result has 58 places, 45 transitions, 391 flow [2020-10-16 05:01:33,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2020-10-16 05:01:33,283 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2020-10-16 05:01:33,284 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 391 flow [2020-10-16 05:01:33,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:01:33,284 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:33,284 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:33,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:01:33,284 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:33,284 INFO L82 PathProgramCache]: Analyzing trace with hash 185885978, now seen corresponding path program 1 times [2020-10-16 05:01:33,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:33,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845664560] [2020-10-16 05:01:33,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:33,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845664560] [2020-10-16 05:01:33,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:33,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:01:33,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323907029] [2020-10-16 05:01:33,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:01:33,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:01:33,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:01:33,371 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 170 [2020-10-16 05:01:33,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 391 flow. Second operand 4 states. [2020-10-16 05:01:33,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:33,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 170 [2020-10-16 05:01:33,372 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:33,554 INFO L129 PetriNetUnfolder]: 372/817 cut-off events. [2020-10-16 05:01:33,554 INFO L130 PetriNetUnfolder]: For 2073/2211 co-relation queries the response was YES. [2020-10-16 05:01:33,560 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3259 conditions, 817 events. 372/817 cut-off events. For 2073/2211 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 5602 event pairs, 112 based on Foata normal form. 149/899 useless extension candidates. Maximal degree in co-relation 3243. Up to 428 conditions per place. [2020-10-16 05:01:33,563 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 8 selfloop transitions, 12 changer transitions 1/55 dead transitions. [2020-10-16 05:01:33,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 474 flow [2020-10-16 05:01:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:01:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:01:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2020-10-16 05:01:33,567 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8270588235294117 [2020-10-16 05:01:33,568 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2020-10-16 05:01:33,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2020-10-16 05:01:33,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:33,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2020-10-16 05:01:33,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:01:33,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:01:33,572 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:01:33,572 INFO L185 Difference]: Start difference. First operand has 58 places, 45 transitions, 391 flow. Second operand 5 states and 703 transitions. [2020-10-16 05:01:33,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 474 flow [2020-10-16 05:01:33,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 434 flow, removed 3 selfloop flow, removed 5 redundant places. [2020-10-16 05:01:33,579 INFO L241 Difference]: Finished difference. Result has 60 places, 51 transitions, 436 flow [2020-10-16 05:01:33,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=436, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2020-10-16 05:01:33,580 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2020-10-16 05:01:33,580 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 436 flow [2020-10-16 05:01:33,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:01:33,580 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:33,580 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:33,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:01:33,581 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash -183817284, now seen corresponding path program 1 times [2020-10-16 05:01:33,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:33,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124481438] [2020-10-16 05:01:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:33,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124481438] [2020-10-16 05:01:33,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:33,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:01:33,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638685973] [2020-10-16 05:01:33,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:01:33,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:33,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:01:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:01:33,709 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 170 [2020-10-16 05:01:33,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 436 flow. Second operand 5 states. [2020-10-16 05:01:33,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:33,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 170 [2020-10-16 05:01:33,764 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:33,881 INFO L129 PetriNetUnfolder]: 126/335 cut-off events. [2020-10-16 05:01:33,882 INFO L130 PetriNetUnfolder]: For 1651/1932 co-relation queries the response was YES. [2020-10-16 05:01:33,884 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 335 events. 126/335 cut-off events. For 1651/1932 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1970 event pairs, 8 based on Foata normal form. 193/521 useless extension candidates. Maximal degree in co-relation 1668. Up to 182 conditions per place. [2020-10-16 05:01:33,886 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 5 selfloop transitions, 18 changer transitions 4/61 dead transitions. [2020-10-16 05:01:33,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 572 flow [2020-10-16 05:01:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:01:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:01:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 984 transitions. [2020-10-16 05:01:33,890 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.826890756302521 [2020-10-16 05:01:33,890 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 984 transitions. [2020-10-16 05:01:33,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 984 transitions. [2020-10-16 05:01:33,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:33,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 984 transitions. [2020-10-16 05:01:33,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:01:33,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:01:33,896 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:01:33,896 INFO L185 Difference]: Start difference. First operand has 60 places, 51 transitions, 436 flow. Second operand 7 states and 984 transitions. [2020-10-16 05:01:33,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 572 flow [2020-10-16 05:01:33,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 555 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 05:01:33,902 INFO L241 Difference]: Finished difference. Result has 66 places, 57 transitions, 533 flow [2020-10-16 05:01:33,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=533, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2020-10-16 05:01:33,902 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2020-10-16 05:01:33,903 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 533 flow [2020-10-16 05:01:33,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:01:33,903 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:33,903 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:33,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:01:33,903 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash 350496704, now seen corresponding path program 1 times [2020-10-16 05:01:33,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:33,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715217596] [2020-10-16 05:01:33,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:34,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715217596] [2020-10-16 05:01:34,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:34,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:01:34,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083689037] [2020-10-16 05:01:34,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:01:34,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:34,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:01:34,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:01:34,101 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 170 [2020-10-16 05:01:34,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 533 flow. Second operand 6 states. [2020-10-16 05:01:34,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:34,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 170 [2020-10-16 05:01:34,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:34,233 INFO L129 PetriNetUnfolder]: 82/263 cut-off events. [2020-10-16 05:01:34,233 INFO L130 PetriNetUnfolder]: For 2230/2576 co-relation queries the response was YES. [2020-10-16 05:01:34,235 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 263 events. 82/263 cut-off events. For 2230/2576 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1616 event pairs, 1 based on Foata normal form. 169/431 useless extension candidates. Maximal degree in co-relation 1525. Up to 155 conditions per place. [2020-10-16 05:01:34,237 INFO L132 encePairwiseOnDemand]: 164/170 looper letters, 2 selfloop transitions, 22 changer transitions 3/61 dead transitions. [2020-10-16 05:01:34,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 625 flow [2020-10-16 05:01:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:01:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:01:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1259 transitions. [2020-10-16 05:01:34,242 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.822875816993464 [2020-10-16 05:01:34,242 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1259 transitions. [2020-10-16 05:01:34,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1259 transitions. [2020-10-16 05:01:34,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:34,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1259 transitions. [2020-10-16 05:01:34,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:01:34,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:01:34,248 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:01:34,249 INFO L185 Difference]: Start difference. First operand has 66 places, 57 transitions, 533 flow. Second operand 9 states and 1259 transitions. [2020-10-16 05:01:34,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 625 flow [2020-10-16 05:01:34,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 541 flow, removed 31 selfloop flow, removed 4 redundant places. [2020-10-16 05:01:34,257 INFO L241 Difference]: Finished difference. Result has 73 places, 58 transitions, 516 flow [2020-10-16 05:01:34,257 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=516, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2020-10-16 05:01:34,257 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2020-10-16 05:01:34,258 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 516 flow [2020-10-16 05:01:34,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:01:34,258 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:34,258 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:34,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:01:34,258 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2052314270, now seen corresponding path program 1 times [2020-10-16 05:01:34,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:34,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019591969] [2020-10-16 05:01:34,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:34,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019591969] [2020-10-16 05:01:34,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:34,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:01:34,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697123634] [2020-10-16 05:01:34,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:01:34,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:01:34,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:01:34,657 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 170 [2020-10-16 05:01:34,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 516 flow. Second operand 10 states. [2020-10-16 05:01:34,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:34,658 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 170 [2020-10-16 05:01:34,658 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:35,265 INFO L129 PetriNetUnfolder]: 117/388 cut-off events. [2020-10-16 05:01:35,266 INFO L130 PetriNetUnfolder]: For 2791/2906 co-relation queries the response was YES. [2020-10-16 05:01:35,269 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 388 events. 117/388 cut-off events. For 2791/2906 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2747 event pairs, 0 based on Foata normal form. 90/476 useless extension candidates. Maximal degree in co-relation 1915. Up to 106 conditions per place. [2020-10-16 05:01:35,271 INFO L132 encePairwiseOnDemand]: 161/170 looper letters, 21 selfloop transitions, 4 changer transitions 31/84 dead transitions. [2020-10-16 05:01:35,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 861 flow [2020-10-16 05:01:35,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:01:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:01:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1019 transitions. [2020-10-16 05:01:35,275 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6660130718954248 [2020-10-16 05:01:35,276 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1019 transitions. [2020-10-16 05:01:35,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1019 transitions. [2020-10-16 05:01:35,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:35,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1019 transitions. [2020-10-16 05:01:35,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:01:35,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:01:35,282 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:01:35,282 INFO L185 Difference]: Start difference. First operand has 73 places, 58 transitions, 516 flow. Second operand 9 states and 1019 transitions. [2020-10-16 05:01:35,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 84 transitions, 861 flow [2020-10-16 05:01:35,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 783 flow, removed 19 selfloop flow, removed 8 redundant places. [2020-10-16 05:01:35,295 INFO L241 Difference]: Finished difference. Result has 76 places, 52 transitions, 418 flow [2020-10-16 05:01:35,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=418, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2020-10-16 05:01:35,296 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 43 predicate places. [2020-10-16 05:01:35,296 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 418 flow [2020-10-16 05:01:35,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:01:35,296 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:35,296 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:35,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:01:35,297 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1161882470, now seen corresponding path program 2 times [2020-10-16 05:01:35,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:35,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311040788] [2020-10-16 05:01:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:01:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:01:35,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311040788] [2020-10-16 05:01:35,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:01:35,494 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:01:35,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945571033] [2020-10-16 05:01:35,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:01:35,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:01:35,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:01:35,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:01:35,497 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 170 [2020-10-16 05:01:35,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 418 flow. Second operand 7 states. [2020-10-16 05:01:35,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:01:35,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 170 [2020-10-16 05:01:35,498 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:01:35,760 INFO L129 PetriNetUnfolder]: 63/223 cut-off events. [2020-10-16 05:01:35,760 INFO L130 PetriNetUnfolder]: For 761/807 co-relation queries the response was YES. [2020-10-16 05:01:35,762 INFO L80 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 223 events. 63/223 cut-off events. For 761/807 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1346 event pairs, 0 based on Foata normal form. 38/261 useless extension candidates. Maximal degree in co-relation 934. Up to 70 conditions per place. [2020-10-16 05:01:35,763 INFO L132 encePairwiseOnDemand]: 163/170 looper letters, 14 selfloop transitions, 13 changer transitions 13/67 dead transitions. [2020-10-16 05:01:35,763 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 638 flow [2020-10-16 05:01:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:01:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:01:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 970 transitions. [2020-10-16 05:01:35,768 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7132352941176471 [2020-10-16 05:01:35,768 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 970 transitions. [2020-10-16 05:01:35,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 970 transitions. [2020-10-16 05:01:35,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:01:35,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 970 transitions. [2020-10-16 05:01:35,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:01:35,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:01:35,775 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:01:35,775 INFO L185 Difference]: Start difference. First operand has 76 places, 52 transitions, 418 flow. Second operand 8 states and 970 transitions. [2020-10-16 05:01:35,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 638 flow [2020-10-16 05:01:35,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 564 flow, removed 30 selfloop flow, removed 9 redundant places. [2020-10-16 05:01:35,782 INFO L241 Difference]: Finished difference. Result has 73 places, 53 transitions, 421 flow [2020-10-16 05:01:35,783 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=170, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=421, PETRI_PLACES=73, PETRI_TRANSITIONS=53} [2020-10-16 05:01:35,783 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2020-10-16 05:01:35,783 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 53 transitions, 421 flow [2020-10-16 05:01:35,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:01:35,783 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:01:35,784 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:01:35,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:01:35,784 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:01:35,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:01:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash 746513716, now seen corresponding path program 3 times [2020-10-16 05:01:35,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:01:35,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440300926] [2020-10-16 05:01:35,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:01:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:01:35,876 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:01:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:01:35,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:01:36,010 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:01:36,011 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:01:36,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:01:36,013 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:01:36,029 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1651] [1651] L3-->L851: Formula: (let ((.cse7 (= (mod ~y$r_buff0_thd0~0_In1301575967 256) 0)) (.cse6 (= (mod ~y$w_buff0_used~0_In1301575967 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In1301575967 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1301575967 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1301575967 0)) (or (and .cse0 (= ~y$w_buff1_used~0_Out1301575967 ~y$w_buff1_used~0_In1301575967)) (and (= ~y$w_buff1_used~0_Out1301575967 0) .cse1 .cse2)) (or (and .cse3 .cse4 (= ~y$w_buff0~0_In1301575967 ~y~0_Out1301575967)) (and .cse5 (or (and (= ~y$w_buff1~0_In1301575967 ~y~0_Out1301575967) .cse1 .cse2) (and (= ~y~0_In1301575967 ~y~0_Out1301575967) .cse0)))) (or (and (= 0 ~y$w_buff0_used~0_Out1301575967) .cse3 .cse4) (and .cse5 (= ~y$w_buff0_used~0_In1301575967 ~y$w_buff0_used~0_Out1301575967))) (= ~y$r_buff0_thd0~0_In1301575967 ~y$r_buff0_thd0~0_Out1301575967) (= ~y$r_buff1_thd0~0_In1301575967 ~y$r_buff1_thd0~0_Out1301575967)))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1301575967, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1301575967, ~y$w_buff1~0=~y$w_buff1~0_In1301575967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1301575967, ~y$w_buff0~0=~y$w_buff0~0_In1301575967, ~y~0=~y~0_In1301575967, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1301575967, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1301575967} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1301575967, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1301575967|, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1301575967|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out1301575967|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1301575967|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out1301575967|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1301575967, ~y$w_buff1~0=~y$w_buff1~0_In1301575967, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out1301575967|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1301575967, ~y$w_buff0~0=~y$w_buff0~0_In1301575967, ~y~0=~y~0_Out1301575967, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1301575967, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1301575967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite70, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite69, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 05:01:36,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,046 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,047 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,048 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,053 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,053 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,054 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,054 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,055 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,055 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,056 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,056 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,056 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,056 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,057 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,057 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,057 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,057 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,058 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,058 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,058 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,058 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,059 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,059 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,060 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,060 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,061 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,061 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,062 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,062 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,063 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,063 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,064 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,064 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,064 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,064 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,065 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,065 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,065 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:01:36,065 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:01:36,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:01:36 BasicIcfg [2020-10-16 05:01:36,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:01:36,159 INFO L168 Benchmark]: Toolchain (without parser) took 28072.14 ms. Allocated memory was 254.3 MB in the beginning and 802.7 MB in the end (delta: 548.4 MB). Free memory was 210.3 MB in the beginning and 283.3 MB in the end (delta: -73.1 MB). Peak memory consumption was 475.3 MB. Max. memory is 14.2 GB. [2020-10-16 05:01:36,159 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:01:36,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 965.47 ms. Allocated memory was 254.3 MB in the beginning and 325.1 MB in the end (delta: 70.8 MB). Free memory was 210.3 MB in the beginning and 268.3 MB in the end (delta: -58.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:01:36,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.70 ms. Allocated memory is still 325.1 MB. Free memory was 268.3 MB in the beginning and 265.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:01:36,168 INFO L168 Benchmark]: Boogie Preprocessor took 87.01 ms. Allocated memory is still 325.1 MB. Free memory was 265.8 MB in the beginning and 263.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:01:36,170 INFO L168 Benchmark]: RCFGBuilder took 3294.27 ms. Allocated memory was 325.1 MB in the beginning and 424.7 MB in the end (delta: 99.6 MB). Free memory was 263.2 MB in the beginning and 373.4 MB in the end (delta: -110.1 MB). Peak memory consumption was 151.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:01:36,170 INFO L168 Benchmark]: TraceAbstraction took 23610.64 ms. Allocated memory was 424.7 MB in the beginning and 802.7 MB in the end (delta: 378.0 MB). Free memory was 373.4 MB in the beginning and 283.3 MB in the end (delta: 90.0 MB). Peak memory consumption was 468.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:01:36,178 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 254.3 MB. Free memory is still 230.7 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 965.47 ms. Allocated memory was 254.3 MB in the beginning and 325.1 MB in the end (delta: 70.8 MB). Free memory was 210.3 MB in the beginning and 268.3 MB in the end (delta: -58.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 107.70 ms. Allocated memory is still 325.1 MB. Free memory was 268.3 MB in the beginning and 265.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 87.01 ms. Allocated memory is still 325.1 MB. Free memory was 265.8 MB in the beginning and 263.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3294.27 ms. Allocated memory was 325.1 MB in the beginning and 424.7 MB in the end (delta: 99.6 MB). Free memory was 263.2 MB in the beginning and 373.4 MB in the end (delta: -110.1 MB). Peak memory consumption was 151.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 23610.64 ms. Allocated memory was 424.7 MB in the beginning and 802.7 MB in the end (delta: 378.0 MB). Free memory was 373.4 MB in the beginning and 283.3 MB in the end (delta: 90.0 MB). Peak memory consumption was 468.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1107 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 86 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 5.1s, 110 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.4s, 98 PlacesBefore, 33 PlacesAfterwards, 90 TransitionsBefore, 23 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4321 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L710] 0 int y = 0; [L711] 0 _Bool y$flush_delayed; [L712] 0 int y$mem_tmp; [L713] 0 _Bool y$r_buff0_thd0; [L714] 0 _Bool y$r_buff0_thd1; [L715] 0 _Bool y$r_buff0_thd2; [L716] 0 _Bool y$r_buff0_thd3; [L717] 0 _Bool y$r_buff1_thd0; [L718] 0 _Bool y$r_buff1_thd1; [L719] 0 _Bool y$r_buff1_thd2; [L720] 0 _Bool y$r_buff1_thd3; [L721] 0 _Bool y$read_delayed; [L722] 0 int *y$read_delayed_var; [L723] 0 int y$w_buff0; [L724] 0 _Bool y$w_buff0_used; [L725] 0 int y$w_buff1; [L726] 0 _Bool y$w_buff1_used; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1849; [L836] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$w_buff1 = y$w_buff0 [L733] 1 y$w_buff0 = 2 [L734] 1 y$w_buff1_used = y$w_buff0_used [L735] 1 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L737] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L738] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L739] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L740] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L741] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 pthread_t t1850; [L838] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L839] 0 pthread_t t1851; [L840] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 y$flush_delayed = weak$$choice2 [L784] 3 y$mem_tmp = y [L785] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L785] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L786] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L786] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L786] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L786] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L787] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L787] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L788] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L788] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L788] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L788] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L789] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L789] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L790] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L791] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L791] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = y [L793] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L793] 3 y = y$flush_delayed ? y$mem_tmp : y [L794] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L797] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 3 y$flush_delayed = weak$$choice2 [L800] 3 y$mem_tmp = y [L801] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L801] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L802] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L802] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L802] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L802] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L803] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L803] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L803] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L803] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L804] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L804] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L804] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L805] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L805] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L806] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L807] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L807] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L807] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 __unbuffered_p2_EBX = y [L809] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L809] 3 y = y$flush_delayed ? y$mem_tmp : y [L810] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L865] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L865] 0 y = y$flush_delayed ? y$mem_tmp : y [L866] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.5s, HoareTripleCheckerStatistics: 75 SDtfs, 107 SDslu, 60 SDs, 0 SdLazy, 498 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 32742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 incorrect! Received shutdown request...