/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/safe032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:10:30,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:10:30,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:10:30,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:10:30,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:10:30,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:10:30,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:10:30,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:10:30,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:10:30,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:10:30,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:10:30,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:10:30,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:10:30,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:10:30,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:10:30,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:10:30,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:10:30,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:10:30,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:10:30,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:10:30,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:10:30,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:10:30,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:10:30,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:10:30,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:10:30,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:10:30,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:10:30,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:10:30,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:10:30,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:10:30,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:10:30,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:10:30,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:10:30,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:10:30,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:10:30,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:10:30,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:10:30,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:10:30,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:10:30,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:10:30,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:10:30,082 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:10:30,106 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:10:30,106 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:10:30,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:10:30,108 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:10:30,108 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:10:30,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:10:30,109 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:10:30,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:10:30,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:10:30,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:10:30,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:10:30,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:10:30,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:10:30,110 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:10:30,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:10:30,110 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:10:30,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:10:30,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:10:30,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:10:30,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:10:30,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:10:30,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:10:30,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:10:30,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:10:30,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:10:30,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:10:30,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:10:30,113 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:10:30,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:10:30,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:10:30,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:10:30,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:10:30,453 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:10:30,453 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:10:30,454 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2020-10-16 05:10:30,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a740e588/7b7a3c9489914451bd3a405e0b436b42/FLAGe6930d72d [2020-10-16 05:10:31,020 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:10:31,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2020-10-16 05:10:31,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a740e588/7b7a3c9489914451bd3a405e0b436b42/FLAGe6930d72d [2020-10-16 05:10:31,315 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a740e588/7b7a3c9489914451bd3a405e0b436b42 [2020-10-16 05:10:31,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:10:31,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:10:31,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:10:31,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:10:31,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:10:31,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:10:31" (1/1) ... [2020-10-16 05:10:31,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc84367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:31, skipping insertion in model container [2020-10-16 05:10:31,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:10:31" (1/1) ... [2020-10-16 05:10:31,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:10:31,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:10:32,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:10:32,091 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:10:32,156 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:10:32,238 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:10:32,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32 WrapperNode [2020-10-16 05:10:32,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:10:32,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:10:32,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:10:32,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:10:32,250 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:10:32" (1/1) ... [2020-10-16 05:10:32,274 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:10:32" (1/1) ... [2020-10-16 05:10:32,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:10:32,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:10:32,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:10:32,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:10:32,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (1/1) ... [2020-10-16 05:10:32,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (1/1) ... [2020-10-16 05:10:32,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (1/1) ... [2020-10-16 05:10:32,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (1/1) ... [2020-10-16 05:10:32,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (1/1) ... [2020-10-16 05:10:32,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (1/1) ... [2020-10-16 05:10:32,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (1/1) ... [2020-10-16 05:10:32,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:10:32,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:10:32,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:10:32,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:10:32,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (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:10:32,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:10:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:10:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:10:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:10:32,477 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:10:32,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:10:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:10:32,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:10:32,478 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:10:32,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:10:32,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:10:32,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:10:32,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:10:32,482 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:10:36,047 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:10:36,047 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:10:36,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:10:36 BoogieIcfgContainer [2020-10-16 05:10:36,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:10:36,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:10:36,054 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:10:36,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:10:36,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:10:31" (1/3) ... [2020-10-16 05:10:36,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9f4541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:10:36, skipping insertion in model container [2020-10-16 05:10:36,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:10:32" (2/3) ... [2020-10-16 05:10:36,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9f4541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:10:36, skipping insertion in model container [2020-10-16 05:10:36,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:10:36" (3/3) ... [2020-10-16 05:10:36,063 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.oepc.i [2020-10-16 05:10:36,082 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:10:36,093 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:10:36,094 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:10:36,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,258 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,260 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,260 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,267 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,278 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,278 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,278 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,278 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,285 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,286 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,291 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,292 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,298 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,299 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,300 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,309 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,310 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,311 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,312 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,312 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,313 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:10:36,341 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:10:36,371 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:10:36,371 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:10:36,371 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:10:36,371 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:10:36,372 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:10:36,372 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:10:36,372 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:10:36,372 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:10:36,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 05:10:36,446 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 05:10:36,446 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:10:36,452 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:10:36,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 05:10:36,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-16 05:10:36,464 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:10:36,467 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 05:10:36,472 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 05:10:36,473 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 89 transitions, 187 flow [2020-10-16 05:10:36,499 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 05:10:36,499 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:10:36,500 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 05:10:36,503 INFO L117 LiptonReduction]: Number of co-enabled transitions 1624 [2020-10-16 05:10:36,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:36,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:36,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:36,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:36,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:36,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:36,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:36,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:36,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:36,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,717 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:10:36,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:36,721 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:10:36,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:36,724 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:10:36,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:36,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:36,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,734 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:10:36,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,736 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:10:36,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:36,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:36,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:36,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,937 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:10:36,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,940 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:10:36,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,942 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:10:36,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,952 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, 3, 2, 1] term [2020-10-16 05:10:36,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:36,956 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:10:36,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:36,959 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, 3, 2, 1] term [2020-10-16 05:10:36,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:36,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:36,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:36,969 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:10:36,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:36,972 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:10:36,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:36,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:36,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:36,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:36,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:37,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,152 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:10:37,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,155 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:10:37,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,157 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:10:37,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,161 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, 3, 2, 1] term [2020-10-16 05:10:37,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,163 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:10:37,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,164 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:10:37,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:37,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,170 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:10:37,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:37,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,178 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:10:37,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 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:10:37,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:37,186 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:10:37,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:37,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 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:10:37,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:37,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:37,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:37,194 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:10:37,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:37,198 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:10:37,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:37,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 05:10:37,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:37,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:37,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:37,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:37,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:37,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:37,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:37,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:37,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:37,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:37,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:37,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,603 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:10:37,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:37,605 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:10:37,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:37,608 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:10:37,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:37,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:37,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,614 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:10:37,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,616 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:10:37,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:37,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:37,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:37,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:37,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:37,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:37,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:38,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:38,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:38,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:38,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:38,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:38,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:38,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,214 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:10:38,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,216 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:10:38,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,217 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:10:38,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,224 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:10:38,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,226 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:10:38,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:38,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:38,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:38,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,405 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:10:38,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,406 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:10:38,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,409 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:10:38,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,410 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:10:38,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,412 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:10:38,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,413 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:10:38,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:38,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:38,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,418 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:10:38,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:38,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,423 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:10:38,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:38,425 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:10:38,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:38,429 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:10:38,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:38,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,435 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:10:38,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,438 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:10:38,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:38,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:38,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:38,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:38,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:38,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,626 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:10:38,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,628 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:10:38,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,629 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:10:38,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,633 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, 3, 2, 1] term [2020-10-16 05:10:38,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:38,636 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:10:38,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:38,638 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, 3, 2, 1] term [2020-10-16 05:10:38,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:38,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,644 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:10:38,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,646 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:10:38,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:38,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:38,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:38,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,724 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:10:38,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,727 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:10:38,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,729 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:10:38,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,733 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:10:38,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,736 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:10:38,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:38,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:38,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:38,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:38,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:38,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:38,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:38,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 05:10:38,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:38,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:38,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:38,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:38,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,926 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:10:38,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,927 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:10:38,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,930 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:10:38,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:38,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,934 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:10:38,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,936 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:10:38,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:38,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:38,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:38,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:38,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:38,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:38,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:39,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:39,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:39,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:39,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:10:39,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,104 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:10:39,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:39,106 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:10:39,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:39,110 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:10:39,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:39,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,114 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:10:39,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,116 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:10:39,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,246 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:10:39,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,248 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:10:39,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,249 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:10:39,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,251 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:10:39,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,252 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:10:39,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,255 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:10:39,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,256 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:10:39,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,258 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:10:39,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,259 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:10:39,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,260 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:10:39,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,262 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:10:39,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,266 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:10:39,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,271 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:10:39,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,273 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:10:39,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,276 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:10:39,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,279 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:10:39,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,284 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:10:39,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,285 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:10:39,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,289 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:10:39,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,291 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:10:39,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,295 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:10:39,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,300 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:10:39,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,303 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:10:39,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,404 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:10:39,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,406 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:10:39,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,407 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:10:39,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,419 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:10:39,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,421 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:10:39,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,423 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:10:39,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,428 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:10:39,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,430 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:10:39,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 05:10:39,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,812 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:10:39,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,813 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:10:39,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,814 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:10:39,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,817 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:10:39,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,818 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:10:39,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,820 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:10:39,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,825 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:10:39,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,826 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:10:39,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,929 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:10:39,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,930 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:10:39,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,932 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:10:39,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,936 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:10:39,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,937 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:10:39,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,939 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:10:39,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,940 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:10:39,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:39,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:39,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:39,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,950 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:10:39,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:39,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 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:10:39,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,957 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:10:39,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 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:10:39,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:39,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:10:39,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,965 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:10:39,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:39,969 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:10:39,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:40,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:40,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:40,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:40,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:40,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:40,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:40,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 05:10:40,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:40,519 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 05:10:40,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:40,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:40,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:40,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:40,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:40,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:40,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:40,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:40,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:40,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:40,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:40,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:40,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:40,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:40,828 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:10:40,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:40,830 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:10:40,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:40,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:40,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:40,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:40,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:40,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:40,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:40,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:40,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:40,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:40,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:40,944 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:10:40,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:40,945 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:10:40,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:40,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:40,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:40,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:40,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:41,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:41,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:41,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:41,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:41,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:41,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:41,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:10:41,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:41,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:41,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:41,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-16 05:10:41,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:41,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:41,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:42,214 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-16 05:10:42,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 05:10:42,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:42,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:10:42,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,405 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-16 05:10:43,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:43,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:43,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:43,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:43,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:43,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:43,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:43,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,555 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:10:43,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,556 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:10:43,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,665 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:10:43,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,666 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:10:43,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,668 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:10:43,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,670 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, 3, 2, 1] term [2020-10-16 05:10:43,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,671 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:10:43,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,673 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, 3, 2, 1] term [2020-10-16 05:10:43,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:43,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,679 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:10:43,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,681 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:10:43,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:43,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,768 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:10:43,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,769 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:10:43,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,771 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:10:43,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,772 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:10:43,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,773 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:10:43,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,781 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:10:43,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,782 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:10:43,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,784 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:10:43,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:43,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,789 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:10:43,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,792 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, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:43,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:43,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:43,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:43,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:43,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:43,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:10:43,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:10:43,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:43,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:43,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:43,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,976 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:10:43,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:43,977 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:10:43,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:44,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:44,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:44,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:44,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:44,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,050 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:10:44,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,052 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:10:44,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:44,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:44,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,355 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:10:44,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,356 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:10:44,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,356 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:10:44,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,358 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, 3, 2, 1] term [2020-10-16 05:10:44,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,360 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:10:44,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,361 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, 3, 2, 1] term [2020-10-16 05:10:44,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:44,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,367 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:10:44,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,371 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:10:44,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:44,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,503 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:10:44,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,505 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:10:44,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,507 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:10:44,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,521 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, 3, 2, 1] term [2020-10-16 05:10:44,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,525 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:10:44,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,527 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, 3, 2, 1] term [2020-10-16 05:10:44,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:44,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,534 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:10:44,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,536 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:10:44,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:44,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:44,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:44,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:44,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:44,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,632 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:10:44,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,634 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:10:44,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:44,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:44,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:44,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:44,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:44,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,826 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:10:44,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,827 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:10:44,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:44,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:44,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:44,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:44,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:10:44,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:10:44,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:44,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 05:10:44,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:45,678 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 05:10:46,250 WARN L193 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 106 [2020-10-16 05:10:46,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:46,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:46,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:10:46,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:46,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:46,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,336 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:10:46,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,337 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:10:46,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:46,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:46,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:46,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,399 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:10:46,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,401 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:10:46,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:46,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:46,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:10:46,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:46,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:46,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:46,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:46,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:10:46,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,545 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:10:46,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,546 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:10:46,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:46,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 3, 2, 1] term [2020-10-16 05:10:46,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:46,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 3, 2, 1] term [2020-10-16 05:10:46,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:46,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 3, 2, 1] term [2020-10-16 05:10:46,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:46,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 3, 2, 1] term [2020-10-16 05:10:46,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:46,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 7, 3, 7, 3, 7, 3, 7, 3, 3, 2, 1] term [2020-10-16 05:10:46,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:46,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 7, 3, 7, 3, 7, 3, 7, 3, 3, 2, 1] term [2020-10-16 05:10:46,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:46,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:46,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:46,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:46,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:46,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:46,820 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:10:46,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:46,821 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:10:46,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:47,782 WARN L193 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2020-10-16 05:10:48,606 WARN L193 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 129 [2020-10-16 05:10:48,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:48,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:48,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:48,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:48,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:10:48,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:48,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:48,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,668 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:10:48,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,669 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:10:48,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:48,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,674 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:10:48,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,676 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:10:48,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:48,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:48,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:48,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,735 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:10:48,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,736 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:10:48,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:48,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:48,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:48,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:10:48,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,776 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:10:48,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,777 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:10:48,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:48,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:48,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:48,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:10:48,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,876 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:10:48,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,878 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:10:48,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:48,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:48,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:48,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:48,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,920 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:10:48,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,920 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:10:48,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:48,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:10:48,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:48,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:48,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:48,977 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:10:48,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,978 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:10:48,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:48,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,981 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:10:48,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,982 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:10:48,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:48,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:48,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:49,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:10:49,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,048 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:10:49,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,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:10:49,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:49,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:49,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:49,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,092 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:10:49,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,093 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:10:49,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:49,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:49,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,129 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:10:49,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,131 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:10:49,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,134 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:10:49,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,136 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:10:49,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:49,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:49,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:10:49,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:10:49,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,243 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:10:49,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,244 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:10:49,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:10:49,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:10:49,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,279 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:10:49,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,280 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:10:49,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,548 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 05:10:49,663 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 05:10:49,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:49,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:49,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:49,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,692 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:10:49,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,693 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:10:49,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,696 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:10:49,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,697 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:10:49,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:49,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:49,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,767 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:10:49,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,768 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:10:49,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,770 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:10:49,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,771 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:10:49,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:49,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:10:49,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 05:10:49,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:49,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:10:49,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:10:49,840 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:10:49,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,841 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:10:49,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 05:10:49,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,845 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:10:49,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,847 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:10:49,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:10:49,916 INFO L132 LiptonReduction]: Checked pairs total: 4587 [2020-10-16 05:10:49,916 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 05:10:49,929 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13468 [2020-10-16 05:10:49,945 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2020-10-16 05:10:49,945 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:10:49,946 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:49,947 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:49,948 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1033422208, now seen corresponding path program 1 times [2020-10-16 05:10:49,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:49,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623836507] [2020-10-16 05:10:49,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:50,337 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:10:50,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623836507] [2020-10-16 05:10:50,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:50,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:10:50,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853678287] [2020-10-16 05:10:50,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:10:50,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:10:50,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:10:50,382 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 169 [2020-10-16 05:10:50,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states. [2020-10-16 05:10:50,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:50,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 169 [2020-10-16 05:10:50,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:50,745 INFO L129 PetriNetUnfolder]: 161/336 cut-off events. [2020-10-16 05:10:50,745 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:10:50,747 INFO L80 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 336 events. 161/336 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1689 event pairs, 33 based on Foata normal form. 23/331 useless extension candidates. Maximal degree in co-relation 594. Up to 193 conditions per place. [2020-10-16 05:10:50,750 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 13 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2020-10-16 05:10:50,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 101 flow [2020-10-16 05:10:50,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:10:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:10:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2020-10-16 05:10:50,769 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8382642998027613 [2020-10-16 05:10:50,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2020-10-16 05:10:50,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2020-10-16 05:10:50,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:50,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2020-10-16 05:10:50,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:10:50,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:10:50,792 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:10:50,794 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 425 transitions. [2020-10-16 05:10:50,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 101 flow [2020-10-16 05:10:50,802 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:10:50,804 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2020-10-16 05:10:50,808 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, 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:10:50,809 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 05:10:50,809 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2020-10-16 05:10:50,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:10:50,809 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:50,810 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:50,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:10:50,810 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:50,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:50,811 INFO L82 PathProgramCache]: Analyzing trace with hash 981365630, now seen corresponding path program 1 times [2020-10-16 05:10:50,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:50,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407675514] [2020-10-16 05:10:50,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:50,949 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:10:50,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407675514] [2020-10-16 05:10:50,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:50,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:10:50,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636756896] [2020-10-16 05:10:50,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:10:50,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:50,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:10:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:10:50,954 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 169 [2020-10-16 05:10:50,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states. [2020-10-16 05:10:50,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:50,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 169 [2020-10-16 05:10:50,955 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:51,073 INFO L129 PetriNetUnfolder]: 105/212 cut-off events. [2020-10-16 05:10:51,073 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2020-10-16 05:10:51,074 INFO L80 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 212 events. 105/212 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 943 event pairs, 31 based on Foata normal form. 4/212 useless extension candidates. Maximal degree in co-relation 406. Up to 161 conditions per place. [2020-10-16 05:10:51,076 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 11 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2020-10-16 05:10:51,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 26 transitions, 92 flow [2020-10-16 05:10:51,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:10:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:10:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2020-10-16 05:10:51,080 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7988165680473372 [2020-10-16 05:10:51,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2020-10-16 05:10:51,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2020-10-16 05:10:51,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:51,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2020-10-16 05:10:51,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:10:51,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:10:51,083 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:10:51,084 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 405 transitions. [2020-10-16 05:10:51,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 26 transitions, 92 flow [2020-10-16 05:10:51,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:10:51,085 INFO L241 Difference]: Finished difference. Result has 31 places, 23 transitions, 67 flow [2020-10-16 05:10:51,085 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, 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:10:51,086 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2020-10-16 05:10:51,086 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2020-10-16 05:10:51,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:10:51,086 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:51,087 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:51,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:10:51,087 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 357563508, now seen corresponding path program 1 times [2020-10-16 05:10:51,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:51,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771472905] [2020-10-16 05:10:51,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:51,157 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:10:51,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771472905] [2020-10-16 05:10:51,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:51,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:10:51,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887790310] [2020-10-16 05:10:51,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:10:51,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:51,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:10:51,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:10:51,162 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 169 [2020-10-16 05:10:51,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states. [2020-10-16 05:10:51,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:51,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 169 [2020-10-16 05:10:51,163 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:51,181 INFO L129 PetriNetUnfolder]: 2/27 cut-off events. [2020-10-16 05:10:51,181 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2020-10-16 05:10:51,181 INFO L80 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 27 events. 2/27 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 42. Up to 8 conditions per place. [2020-10-16 05:10:51,182 INFO L132 encePairwiseOnDemand]: 166/169 looper letters, 1 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2020-10-16 05:10:51,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 75 flow [2020-10-16 05:10:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:10:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:10:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2020-10-16 05:10:51,185 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2020-10-16 05:10:51,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2020-10-16 05:10:51,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2020-10-16 05:10:51,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:51,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2020-10-16 05:10:51,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:10:51,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:10:51,187 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:10:51,188 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 442 transitions. [2020-10-16 05:10:51,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 75 flow [2020-10-16 05:10:51,188 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:10:51,189 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 75 flow [2020-10-16 05:10:51,189 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, 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:10:51,189 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2020-10-16 05:10:51,189 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 75 flow [2020-10-16 05:10:51,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:10:51,190 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:51,190 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:51,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:10:51,190 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:51,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:51,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1678623485, now seen corresponding path program 1 times [2020-10-16 05:10:51,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:51,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003584690] [2020-10-16 05:10:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:51,262 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:10:51,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003584690] [2020-10-16 05:10:51,262 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:51,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:10:51,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700357924] [2020-10-16 05:10:51,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:10:51,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:51,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:10:51,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:10:51,265 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 169 [2020-10-16 05:10:51,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 75 flow. Second operand 3 states. [2020-10-16 05:10:51,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:51,266 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 169 [2020-10-16 05:10:51,266 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:51,283 INFO L129 PetriNetUnfolder]: 5/37 cut-off events. [2020-10-16 05:10:51,283 INFO L130 PetriNetUnfolder]: For 16/18 co-relation queries the response was YES. [2020-10-16 05:10:51,284 INFO L80 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 37 events. 5/37 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 82 event pairs, 1 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 66. Up to 11 conditions per place. [2020-10-16 05:10:51,284 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 3 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2020-10-16 05:10:51,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 91 flow [2020-10-16 05:10:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:10:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:10:51,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2020-10-16 05:10:51,287 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8777120315581854 [2020-10-16 05:10:51,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2020-10-16 05:10:51,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2020-10-16 05:10:51,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:51,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2020-10-16 05:10:51,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:10:51,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:10:51,290 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:10:51,290 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 75 flow. Second operand 3 states and 445 transitions. [2020-10-16 05:10:51,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 91 flow [2020-10-16 05:10:51,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 85 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:10:51,291 INFO L241 Difference]: Finished difference. Result has 34 places, 25 transitions, 88 flow [2020-10-16 05:10:51,292 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2020-10-16 05:10:51,292 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2020-10-16 05:10:51,292 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 88 flow [2020-10-16 05:10:51,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:10:51,292 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:51,292 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:51,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:10:51,293 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:51,293 INFO L82 PathProgramCache]: Analyzing trace with hash 665298583, now seen corresponding path program 1 times [2020-10-16 05:10:51,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:51,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952421671] [2020-10-16 05:10:51,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:51,416 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:10:51,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952421671] [2020-10-16 05:10:51,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:51,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:10:51,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566783589] [2020-10-16 05:10:51,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:10:51,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:51,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:10:51,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:10:51,419 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 169 [2020-10-16 05:10:51,420 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 88 flow. Second operand 4 states. [2020-10-16 05:10:51,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:51,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 169 [2020-10-16 05:10:51,420 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:51,631 INFO L129 PetriNetUnfolder]: 159/331 cut-off events. [2020-10-16 05:10:51,632 INFO L130 PetriNetUnfolder]: For 142/145 co-relation queries the response was YES. [2020-10-16 05:10:51,633 INFO L80 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 331 events. 159/331 cut-off events. For 142/145 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1641 event pairs, 28 based on Foata normal form. 7/326 useless extension candidates. Maximal degree in co-relation 742. Up to 178 conditions per place. [2020-10-16 05:10:51,635 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 17 selfloop transitions, 14 changer transitions 0/44 dead transitions. [2020-10-16 05:10:51,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 198 flow [2020-10-16 05:10:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:10:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:10:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 616 transitions. [2020-10-16 05:10:51,639 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7289940828402367 [2020-10-16 05:10:51,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 616 transitions. [2020-10-16 05:10:51,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 616 transitions. [2020-10-16 05:10:51,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:51,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 616 transitions. [2020-10-16 05:10:51,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:10:51,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:10:51,642 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:10:51,643 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 88 flow. Second operand 5 states and 616 transitions. [2020-10-16 05:10:51,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 198 flow [2020-10-16 05:10:51,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 44 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:10:51,645 INFO L241 Difference]: Finished difference. Result has 40 places, 35 transitions, 178 flow [2020-10-16 05:10:51,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2020-10-16 05:10:51,646 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2020-10-16 05:10:51,646 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 178 flow [2020-10-16 05:10:51,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:10:51,646 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:51,646 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:51,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:10:51,647 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:51,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2132786121, now seen corresponding path program 1 times [2020-10-16 05:10:51,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:51,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298472692] [2020-10-16 05:10:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:52,078 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:10:52,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298472692] [2020-10-16 05:10:52,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:52,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:10:52,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021397382] [2020-10-16 05:10:52,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:10:52,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:52,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:10:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:10:52,082 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 169 [2020-10-16 05:10:52,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 178 flow. Second operand 7 states. [2020-10-16 05:10:52,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:52,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 169 [2020-10-16 05:10:52,083 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:52,631 INFO L129 PetriNetUnfolder]: 210/450 cut-off events. [2020-10-16 05:10:52,632 INFO L130 PetriNetUnfolder]: For 590/596 co-relation queries the response was YES. [2020-10-16 05:10:52,634 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 450 events. 210/450 cut-off events. For 590/596 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2601 event pairs, 8 based on Foata normal form. 25/457 useless extension candidates. Maximal degree in co-relation 1395. Up to 189 conditions per place. [2020-10-16 05:10:52,638 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 23 selfloop transitions, 35 changer transitions 0/71 dead transitions. [2020-10-16 05:10:52,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 478 flow [2020-10-16 05:10:52,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:10:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:10:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1022 transitions. [2020-10-16 05:10:52,643 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6719263642340565 [2020-10-16 05:10:52,643 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1022 transitions. [2020-10-16 05:10:52,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1022 transitions. [2020-10-16 05:10:52,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:52,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1022 transitions. [2020-10-16 05:10:52,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:10:52,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:10:52,649 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:10:52,649 INFO L185 Difference]: Start difference. First operand has 40 places, 35 transitions, 178 flow. Second operand 9 states and 1022 transitions. [2020-10-16 05:10:52,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 478 flow [2020-10-16 05:10:52,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:10:52,654 INFO L241 Difference]: Finished difference. Result has 53 places, 61 transitions, 472 flow [2020-10-16 05:10:52,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=472, PETRI_PLACES=53, PETRI_TRANSITIONS=61} [2020-10-16 05:10:52,655 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2020-10-16 05:10:52,655 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 472 flow [2020-10-16 05:10:52,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:10:52,655 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:52,655 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:52,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:10:52,656 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:52,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:52,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1677567865, now seen corresponding path program 1 times [2020-10-16 05:10:52,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:52,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489921337] [2020-10-16 05:10:52,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:53,101 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:10:53,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489921337] [2020-10-16 05:10:53,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:53,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:10:53,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701329020] [2020-10-16 05:10:53,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:10:53,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:53,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:10:53,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:10:53,106 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 169 [2020-10-16 05:10:53,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 472 flow. Second operand 8 states. [2020-10-16 05:10:53,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:53,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 169 [2020-10-16 05:10:53,108 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:53,792 INFO L129 PetriNetUnfolder]: 238/549 cut-off events. [2020-10-16 05:10:53,792 INFO L130 PetriNetUnfolder]: For 1600/1635 co-relation queries the response was YES. [2020-10-16 05:10:53,798 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 549 events. 238/549 cut-off events. For 1600/1635 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3565 event pairs, 3 based on Foata normal form. 31/566 useless extension candidates. Maximal degree in co-relation 2139. Up to 225 conditions per place. [2020-10-16 05:10:53,802 INFO L132 encePairwiseOnDemand]: 162/169 looper letters, 33 selfloop transitions, 42 changer transitions 0/88 dead transitions. [2020-10-16 05:10:53,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 803 flow [2020-10-16 05:10:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:10:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:10:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2020-10-16 05:10:53,808 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7107166337935569 [2020-10-16 05:10:53,808 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2020-10-16 05:10:53,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2020-10-16 05:10:53,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:53,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2020-10-16 05:10:53,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:10:53,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:10:53,815 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:10:53,816 INFO L185 Difference]: Start difference. First operand has 53 places, 61 transitions, 472 flow. Second operand 9 states and 1081 transitions. [2020-10-16 05:10:53,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 803 flow [2020-10-16 05:10:53,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 756 flow, removed 23 selfloop flow, removed 1 redundant places. [2020-10-16 05:10:53,828 INFO L241 Difference]: Finished difference. Result has 63 places, 75 transitions, 678 flow [2020-10-16 05:10:53,828 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=678, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2020-10-16 05:10:53,828 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2020-10-16 05:10:53,829 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 678 flow [2020-10-16 05:10:53,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:10:53,829 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:53,829 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:53,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:10:53,829 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1023628300, now seen corresponding path program 1 times [2020-10-16 05:10:53,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:53,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837204496] [2020-10-16 05:10:53,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:53,875 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:10:53,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837204496] [2020-10-16 05:10:53,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:53,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:10:53,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516719276] [2020-10-16 05:10:53,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:10:53,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:53,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:10:53,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:10:53,878 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 169 [2020-10-16 05:10:53,878 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 678 flow. Second operand 3 states. [2020-10-16 05:10:53,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:53,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 169 [2020-10-16 05:10:53,879 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:53,967 INFO L129 PetriNetUnfolder]: 99/314 cut-off events. [2020-10-16 05:10:53,968 INFO L130 PetriNetUnfolder]: For 1968/2022 co-relation queries the response was YES. [2020-10-16 05:10:53,970 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 314 events. 99/314 cut-off events. For 1968/2022 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1983 event pairs, 0 based on Foata normal form. 11/318 useless extension candidates. Maximal degree in co-relation 1324. Up to 137 conditions per place. [2020-10-16 05:10:53,971 INFO L132 encePairwiseOnDemand]: 166/169 looper letters, 3 selfloop transitions, 3 changer transitions 15/75 dead transitions. [2020-10-16 05:10:53,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 75 transitions, 690 flow [2020-10-16 05:10:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:10:53,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:10:53,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2020-10-16 05:10:53,974 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8757396449704142 [2020-10-16 05:10:53,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2020-10-16 05:10:53,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2020-10-16 05:10:53,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:53,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2020-10-16 05:10:53,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:10:53,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:10:53,977 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:10:53,977 INFO L185 Difference]: Start difference. First operand has 63 places, 75 transitions, 678 flow. Second operand 3 states and 444 transitions. [2020-10-16 05:10:53,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 75 transitions, 690 flow [2020-10-16 05:10:53,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 649 flow, removed 5 selfloop flow, removed 5 redundant places. [2020-10-16 05:10:53,988 INFO L241 Difference]: Finished difference. Result has 61 places, 60 transitions, 494 flow [2020-10-16 05:10:53,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2020-10-16 05:10:53,988 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2020-10-16 05:10:53,988 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 494 flow [2020-10-16 05:10:53,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:10:53,989 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:53,989 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:10:53,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:10:53,989 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:53,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash -722399493, now seen corresponding path program 1 times [2020-10-16 05:10:53,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:53,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546657757] [2020-10-16 05:10:53,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:54,302 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:10:54,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546657757] [2020-10-16 05:10:54,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:54,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:10:54,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628812485] [2020-10-16 05:10:54,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:10:54,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:10:54,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:10:54,305 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2020-10-16 05:10:54,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 494 flow. Second operand 9 states. [2020-10-16 05:10:54,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:54,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2020-10-16 05:10:54,306 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:55,210 INFO L129 PetriNetUnfolder]: 253/673 cut-off events. [2020-10-16 05:10:55,210 INFO L130 PetriNetUnfolder]: For 2197/2231 co-relation queries the response was YES. [2020-10-16 05:10:55,215 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2833 conditions, 673 events. 253/673 cut-off events. For 2197/2231 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4967 event pairs, 2 based on Foata normal form. 14/674 useless extension candidates. Maximal degree in co-relation 2806. Up to 274 conditions per place. [2020-10-16 05:10:55,218 INFO L132 encePairwiseOnDemand]: 161/169 looper letters, 44 selfloop transitions, 34 changer transitions 21/112 dead transitions. [2020-10-16 05:10:55,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 1108 flow [2020-10-16 05:10:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:10:55,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:10:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1215 transitions. [2020-10-16 05:10:55,224 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6535771920387305 [2020-10-16 05:10:55,224 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1215 transitions. [2020-10-16 05:10:55,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1215 transitions. [2020-10-16 05:10:55,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:55,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1215 transitions. [2020-10-16 05:10:55,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:10:55,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:10:55,232 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:10:55,232 INFO L185 Difference]: Start difference. First operand has 61 places, 60 transitions, 494 flow. Second operand 11 states and 1215 transitions. [2020-10-16 05:10:55,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 1108 flow [2020-10-16 05:10:55,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 112 transitions, 1077 flow, removed 9 selfloop flow, removed 5 redundant places. [2020-10-16 05:10:55,244 INFO L241 Difference]: Finished difference. Result has 71 places, 75 transitions, 766 flow [2020-10-16 05:10:55,245 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=766, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2020-10-16 05:10:55,245 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2020-10-16 05:10:55,245 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 766 flow [2020-10-16 05:10:55,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:10:55,245 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:55,245 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:10:55,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:10:55,246 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:55,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:55,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1362007567, now seen corresponding path program 2 times [2020-10-16 05:10:55,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:55,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462793021] [2020-10-16 05:10:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:55,616 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:10:55,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462793021] [2020-10-16 05:10:55,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:55,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:10:55,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955438113] [2020-10-16 05:10:55,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:10:55,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:55,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:10:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:10:55,620 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 169 [2020-10-16 05:10:55,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 766 flow. Second operand 9 states. [2020-10-16 05:10:55,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:55,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 169 [2020-10-16 05:10:55,621 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:56,323 INFO L129 PetriNetUnfolder]: 194/522 cut-off events. [2020-10-16 05:10:56,323 INFO L130 PetriNetUnfolder]: For 2879/3018 co-relation queries the response was YES. [2020-10-16 05:10:56,326 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2730 conditions, 522 events. 194/522 cut-off events. For 2879/3018 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3596 event pairs, 9 based on Foata normal form. 72/585 useless extension candidates. Maximal degree in co-relation 2699. Up to 228 conditions per place. [2020-10-16 05:10:56,330 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 45 selfloop transitions, 38 changer transitions 6/102 dead transitions. [2020-10-16 05:10:56,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 102 transitions, 1209 flow [2020-10-16 05:10:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:10:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:10:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1112 transitions. [2020-10-16 05:10:56,335 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6579881656804734 [2020-10-16 05:10:56,336 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1112 transitions. [2020-10-16 05:10:56,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1112 transitions. [2020-10-16 05:10:56,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:56,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1112 transitions. [2020-10-16 05:10:56,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:10:56,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:10:56,343 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:10:56,343 INFO L185 Difference]: Start difference. First operand has 71 places, 75 transitions, 766 flow. Second operand 10 states and 1112 transitions. [2020-10-16 05:10:56,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 102 transitions, 1209 flow [2020-10-16 05:10:56,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 102 transitions, 1195 flow, removed 5 selfloop flow, removed 2 redundant places. [2020-10-16 05:10:56,356 INFO L241 Difference]: Finished difference. Result has 82 places, 87 transitions, 1047 flow [2020-10-16 05:10:56,357 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1047, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2020-10-16 05:10:56,357 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 49 predicate places. [2020-10-16 05:10:56,357 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 1047 flow [2020-10-16 05:10:56,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:10:56,357 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:56,358 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:10:56,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:10:56,358 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:56,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:56,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1657564378, now seen corresponding path program 1 times [2020-10-16 05:10:56,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:56,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090422342] [2020-10-16 05:10:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:56,432 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:10:56,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090422342] [2020-10-16 05:10:56,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:56,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:10:56,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711998874] [2020-10-16 05:10:56,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:10:56,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:56,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:10:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:10:56,436 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 169 [2020-10-16 05:10:56,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 1047 flow. Second operand 4 states. [2020-10-16 05:10:56,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:56,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 169 [2020-10-16 05:10:56,437 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:56,658 INFO L129 PetriNetUnfolder]: 284/728 cut-off events. [2020-10-16 05:10:56,659 INFO L130 PetriNetUnfolder]: For 3367/3527 co-relation queries the response was YES. [2020-10-16 05:10:56,665 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 728 events. 284/728 cut-off events. For 3367/3527 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 5395 event pairs, 83 based on Foata normal form. 133/816 useless extension candidates. Maximal degree in co-relation 2720. Up to 407 conditions per place. [2020-10-16 05:10:56,668 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 10 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2020-10-16 05:10:56,669 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 93 transitions, 1047 flow [2020-10-16 05:10:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:10:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:10:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2020-10-16 05:10:56,672 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8201183431952662 [2020-10-16 05:10:56,672 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2020-10-16 05:10:56,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2020-10-16 05:10:56,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:56,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2020-10-16 05:10:56,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:10:56,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:10:56,677 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:10:56,678 INFO L185 Difference]: Start difference. First operand has 82 places, 87 transitions, 1047 flow. Second operand 5 states and 693 transitions. [2020-10-16 05:10:56,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 93 transitions, 1047 flow [2020-10-16 05:10:56,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 93 transitions, 985 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-16 05:10:56,693 INFO L241 Difference]: Finished difference. Result has 83 places, 90 transitions, 997 flow [2020-10-16 05:10:56,693 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=997, PETRI_PLACES=83, PETRI_TRANSITIONS=90} [2020-10-16 05:10:56,694 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 50 predicate places. [2020-10-16 05:10:56,694 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 90 transitions, 997 flow [2020-10-16 05:10:56,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:10:56,694 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:56,694 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:56,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:10:56,694 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:56,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:56,695 INFO L82 PathProgramCache]: Analyzing trace with hash 830026398, now seen corresponding path program 1 times [2020-10-16 05:10:56,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:56,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647085328] [2020-10-16 05:10:56,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:56,911 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:10:56,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647085328] [2020-10-16 05:10:56,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:56,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:10:56,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948062976] [2020-10-16 05:10:56,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:10:56,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:56,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:10:56,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:10:56,914 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 169 [2020-10-16 05:10:56,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 90 transitions, 997 flow. Second operand 5 states. [2020-10-16 05:10:56,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:56,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 169 [2020-10-16 05:10:56,915 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:57,178 INFO L129 PetriNetUnfolder]: 178/557 cut-off events. [2020-10-16 05:10:57,178 INFO L130 PetriNetUnfolder]: For 2865/3674 co-relation queries the response was YES. [2020-10-16 05:10:57,185 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 557 events. 178/557 cut-off events. For 2865/3674 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4221 event pairs, 10 based on Foata normal form. 372/897 useless extension candidates. Maximal degree in co-relation 2633. Up to 321 conditions per place. [2020-10-16 05:10:57,189 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 7 selfloop transitions, 15 changer transitions 3/96 dead transitions. [2020-10-16 05:10:57,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 96 transitions, 1049 flow [2020-10-16 05:10:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:10:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:10:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 970 transitions. [2020-10-16 05:10:57,193 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.819949281487743 [2020-10-16 05:10:57,194 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 970 transitions. [2020-10-16 05:10:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 970 transitions. [2020-10-16 05:10:57,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:57,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 970 transitions. [2020-10-16 05:10:57,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:10:57,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:10:57,202 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:10:57,202 INFO L185 Difference]: Start difference. First operand has 83 places, 90 transitions, 997 flow. Second operand 7 states and 970 transitions. [2020-10-16 05:10:57,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 96 transitions, 1049 flow [2020-10-16 05:10:57,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 96 transitions, 1022 flow, removed 4 selfloop flow, removed 4 redundant places. [2020-10-16 05:10:57,221 INFO L241 Difference]: Finished difference. Result has 88 places, 93 transitions, 1021 flow [2020-10-16 05:10:57,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1021, PETRI_PLACES=88, PETRI_TRANSITIONS=93} [2020-10-16 05:10:57,222 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 55 predicate places. [2020-10-16 05:10:57,222 INFO L481 AbstractCegarLoop]: Abstraction has has 88 places, 93 transitions, 1021 flow [2020-10-16 05:10:57,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:10:57,222 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:57,222 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:10:57,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:10:57,223 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1996301446, now seen corresponding path program 1 times [2020-10-16 05:10:57,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:57,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743352453] [2020-10-16 05:10:57,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:57,379 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:10:57,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743352453] [2020-10-16 05:10:57,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:57,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:10:57,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206757756] [2020-10-16 05:10:57,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:10:57,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:57,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:10:57,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:10:57,383 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 169 [2020-10-16 05:10:57,384 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 93 transitions, 1021 flow. Second operand 6 states. [2020-10-16 05:10:57,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:57,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 169 [2020-10-16 05:10:57,384 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:57,600 INFO L129 PetriNetUnfolder]: 138/474 cut-off events. [2020-10-16 05:10:57,600 INFO L130 PetriNetUnfolder]: For 3249/4380 co-relation queries the response was YES. [2020-10-16 05:10:57,606 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 474 events. 138/474 cut-off events. For 3249/4380 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3647 event pairs, 0 based on Foata normal form. 370/814 useless extension candidates. Maximal degree in co-relation 2612. Up to 280 conditions per place. [2020-10-16 05:10:57,609 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 2 selfloop transitions, 19 changer transitions 4/94 dead transitions. [2020-10-16 05:10:57,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 94 transitions, 1058 flow [2020-10-16 05:10:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:10:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:10:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1241 transitions. [2020-10-16 05:10:57,617 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8159105851413544 [2020-10-16 05:10:57,617 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1241 transitions. [2020-10-16 05:10:57,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1241 transitions. [2020-10-16 05:10:57,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:57,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1241 transitions. [2020-10-16 05:10:57,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:10:57,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:10:57,629 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:10:57,629 INFO L185 Difference]: Start difference. First operand has 88 places, 93 transitions, 1021 flow. Second operand 9 states and 1241 transitions. [2020-10-16 05:10:57,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 94 transitions, 1058 flow [2020-10-16 05:10:57,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 967 flow, removed 23 selfloop flow, removed 4 redundant places. [2020-10-16 05:10:57,648 INFO L241 Difference]: Finished difference. Result has 95 places, 90 transitions, 935 flow [2020-10-16 05:10:57,649 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=935, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2020-10-16 05:10:57,649 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 62 predicate places. [2020-10-16 05:10:57,649 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 935 flow [2020-10-16 05:10:57,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:10:57,649 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:57,649 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:10:57,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:10:57,650 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:57,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:57,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1967088053, now seen corresponding path program 1 times [2020-10-16 05:10:57,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:57,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986107621] [2020-10-16 05:10:57,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:58,128 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:10:58,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986107621] [2020-10-16 05:10:58,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:58,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:10:58,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098839986] [2020-10-16 05:10:58,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:10:58,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:10:58,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:10:58,132 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 169 [2020-10-16 05:10:58,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 935 flow. Second operand 10 states. [2020-10-16 05:10:58,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:58,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 169 [2020-10-16 05:10:58,134 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:58,620 INFO L129 PetriNetUnfolder]: 159/563 cut-off events. [2020-10-16 05:10:58,620 INFO L130 PetriNetUnfolder]: For 3023/3299 co-relation queries the response was YES. [2020-10-16 05:10:58,625 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2823 conditions, 563 events. 159/563 cut-off events. For 3023/3299 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 4662 event pairs, 2 based on Foata normal form. 82/609 useless extension candidates. Maximal degree in co-relation 2784. Up to 160 conditions per place. [2020-10-16 05:10:58,627 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 41 selfloop transitions, 14 changer transitions 12/95 dead transitions. [2020-10-16 05:10:58,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 95 transitions, 1136 flow [2020-10-16 05:10:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:10:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:10:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 738 transitions. [2020-10-16 05:10:58,631 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6238377007607777 [2020-10-16 05:10:58,631 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 738 transitions. [2020-10-16 05:10:58,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 738 transitions. [2020-10-16 05:10:58,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:58,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 738 transitions. [2020-10-16 05:10:58,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:10:58,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:10:58,636 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:10:58,636 INFO L185 Difference]: Start difference. First operand has 95 places, 90 transitions, 935 flow. Second operand 7 states and 738 transitions. [2020-10-16 05:10:58,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 95 transitions, 1136 flow [2020-10-16 05:10:58,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 95 transitions, 1056 flow, removed 16 selfloop flow, removed 9 redundant places. [2020-10-16 05:10:58,658 INFO L241 Difference]: Finished difference. Result has 93 places, 83 transitions, 830 flow [2020-10-16 05:10:58,659 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=830, PETRI_PLACES=93, PETRI_TRANSITIONS=83} [2020-10-16 05:10:58,659 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 60 predicate places. [2020-10-16 05:10:58,659 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 83 transitions, 830 flow [2020-10-16 05:10:58,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:10:58,659 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:58,659 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:10:58,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:10:58,660 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1189229919, now seen corresponding path program 2 times [2020-10-16 05:10:58,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:58,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137235735] [2020-10-16 05:10:58,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:10:58,986 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:10:58,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137235735] [2020-10-16 05:10:58,987 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:10:58,987 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:10:58,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878216962] [2020-10-16 05:10:58,988 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:10:58,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:10:58,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:10:58,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:10:58,990 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 169 [2020-10-16 05:10:58,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 83 transitions, 830 flow. Second operand 9 states. [2020-10-16 05:10:58,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:10:58,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 169 [2020-10-16 05:10:58,991 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:10:59,544 INFO L129 PetriNetUnfolder]: 180/634 cut-off events. [2020-10-16 05:10:59,544 INFO L130 PetriNetUnfolder]: For 2076/2280 co-relation queries the response was YES. [2020-10-16 05:10:59,548 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 634 events. 180/634 cut-off events. For 2076/2280 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 5326 event pairs, 2 based on Foata normal form. 101/691 useless extension candidates. Maximal degree in co-relation 2700. Up to 200 conditions per place. [2020-10-16 05:10:59,551 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 35 selfloop transitions, 25 changer transitions 6/92 dead transitions. [2020-10-16 05:10:59,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 1068 flow [2020-10-16 05:10:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:10:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:10:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1063 transitions. [2020-10-16 05:10:59,556 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6289940828402367 [2020-10-16 05:10:59,556 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1063 transitions. [2020-10-16 05:10:59,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1063 transitions. [2020-10-16 05:10:59,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:10:59,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1063 transitions. [2020-10-16 05:10:59,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:10:59,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:10:59,562 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:10:59,562 INFO L185 Difference]: Start difference. First operand has 93 places, 83 transitions, 830 flow. Second operand 10 states and 1063 transitions. [2020-10-16 05:10:59,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 1068 flow [2020-10-16 05:10:59,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 92 transitions, 1014 flow, removed 7 selfloop flow, removed 6 redundant places. [2020-10-16 05:10:59,591 INFO L241 Difference]: Finished difference. Result has 95 places, 84 transitions, 874 flow [2020-10-16 05:10:59,592 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=874, PETRI_PLACES=95, PETRI_TRANSITIONS=84} [2020-10-16 05:10:59,592 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 62 predicate places. [2020-10-16 05:10:59,592 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 84 transitions, 874 flow [2020-10-16 05:10:59,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:10:59,592 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:10:59,593 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:10:59,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:10:59,593 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:10:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:10:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1581079497, now seen corresponding path program 3 times [2020-10-16 05:10:59,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:10:59,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986954677] [2020-10-16 05:10:59,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:10:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:11:00,011 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-10-16 05:11:00,146 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 28 [2020-10-16 05:11:00,219 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:11:00,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986954677] [2020-10-16 05:11:00,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:11:00,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:11:00,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906695704] [2020-10-16 05:11:00,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:11:00,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:11:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:11:00,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:11:00,228 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 169 [2020-10-16 05:11:00,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 84 transitions, 874 flow. Second operand 8 states. [2020-10-16 05:11:00,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:11:00,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 169 [2020-10-16 05:11:00,229 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:11:01,078 INFO L129 PetriNetUnfolder]: 105/384 cut-off events. [2020-10-16 05:11:01,078 INFO L130 PetriNetUnfolder]: For 1253/1367 co-relation queries the response was YES. [2020-10-16 05:11:01,080 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 384 events. 105/384 cut-off events. For 1253/1367 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 2806 event pairs, 0 based on Foata normal form. 55/415 useless extension candidates. Maximal degree in co-relation 1603. Up to 125 conditions per place. [2020-10-16 05:11:01,083 INFO L132 encePairwiseOnDemand]: 162/169 looper letters, 24 selfloop transitions, 30 changer transitions 10/90 dead transitions. [2020-10-16 05:11:01,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 1075 flow [2020-10-16 05:11:01,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:11:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:11:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 958 transitions. [2020-10-16 05:11:01,089 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6298487836949376 [2020-10-16 05:11:01,089 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 958 transitions. [2020-10-16 05:11:01,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 958 transitions. [2020-10-16 05:11:01,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:11:01,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 958 transitions. [2020-10-16 05:11:01,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:11:01,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:11:01,098 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:11:01,098 INFO L185 Difference]: Start difference. First operand has 95 places, 84 transitions, 874 flow. Second operand 9 states and 958 transitions. [2020-10-16 05:11:01,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 90 transitions, 1075 flow [2020-10-16 05:11:01,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 998 flow, removed 23 selfloop flow, removed 8 redundant places. [2020-10-16 05:11:01,112 INFO L241 Difference]: Finished difference. Result has 95 places, 77 transitions, 794 flow [2020-10-16 05:11:01,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=794, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2020-10-16 05:11:01,113 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 62 predicate places. [2020-10-16 05:11:01,113 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 794 flow [2020-10-16 05:11:01,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:11:01,114 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:11:01,114 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:11:01,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:11:01,114 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:11:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:11:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1835609405, now seen corresponding path program 4 times [2020-10-16 05:11:01,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:11:01,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80274706] [2020-10-16 05:11:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:11:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:11:01,271 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:11:01,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80274706] [2020-10-16 05:11:01,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:11:01,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:11:01,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376277017] [2020-10-16 05:11:01,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:11:01,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:11:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:11:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:11:01,276 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 169 [2020-10-16 05:11:01,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 794 flow. Second operand 5 states. [2020-10-16 05:11:01,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:11:01,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 169 [2020-10-16 05:11:01,277 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:11:01,497 INFO L129 PetriNetUnfolder]: 84/314 cut-off events. [2020-10-16 05:11:01,497 INFO L130 PetriNetUnfolder]: For 1075/1171 co-relation queries the response was YES. [2020-10-16 05:11:01,499 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 314 events. 84/314 cut-off events. For 1075/1171 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2139 event pairs, 0 based on Foata normal form. 45/338 useless extension candidates. Maximal degree in co-relation 1311. Up to 100 conditions per place. [2020-10-16 05:11:01,501 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 26 selfloop transitions, 23 changer transitions 3/78 dead transitions. [2020-10-16 05:11:01,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 78 transitions, 912 flow [2020-10-16 05:11:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:11:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:11:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2020-10-16 05:11:01,504 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7011834319526628 [2020-10-16 05:11:01,504 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 711 transitions. [2020-10-16 05:11:01,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 711 transitions. [2020-10-16 05:11:01,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:11:01,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 711 transitions. [2020-10-16 05:11:01,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:11:01,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:11:01,507 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:11:01,507 INFO L185 Difference]: Start difference. First operand has 95 places, 77 transitions, 794 flow. Second operand 6 states and 711 transitions. [2020-10-16 05:11:01,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 78 transitions, 912 flow [2020-10-16 05:11:01,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 78 transitions, 844 flow, removed 8 selfloop flow, removed 10 redundant places. [2020-10-16 05:11:01,518 INFO L241 Difference]: Finished difference. Result has 89 places, 75 transitions, 772 flow [2020-10-16 05:11:01,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=89, PETRI_TRANSITIONS=75} [2020-10-16 05:11:01,519 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 56 predicate places. [2020-10-16 05:11:01,519 INFO L481 AbstractCegarLoop]: Abstraction has has 89 places, 75 transitions, 772 flow [2020-10-16 05:11:01,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:11:01,519 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:11:01,519 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:11:01,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:11:01,520 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:11:01,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:11:01,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1880766497, now seen corresponding path program 5 times [2020-10-16 05:11:01,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:11:01,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992584838] [2020-10-16 05:11:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:11:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:11:01,883 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:11:01,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992584838] [2020-10-16 05:11:01,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:11:01,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:11:01,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618007022] [2020-10-16 05:11:01,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:11:01,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:11:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:11:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:11:01,887 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 169 [2020-10-16 05:11:01,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 75 transitions, 772 flow. Second operand 8 states. [2020-10-16 05:11:01,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:11:01,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 169 [2020-10-16 05:11:01,888 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:11:02,307 INFO L129 PetriNetUnfolder]: 75/289 cut-off events. [2020-10-16 05:11:02,307 INFO L130 PetriNetUnfolder]: For 1047/1153 co-relation queries the response was YES. [2020-10-16 05:11:02,308 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1232 conditions, 289 events. 75/289 cut-off events. For 1047/1153 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 1921 event pairs, 0 based on Foata normal form. 46/317 useless extension candidates. Maximal degree in co-relation 1202. Up to 90 conditions per place. [2020-10-16 05:11:02,309 INFO L132 encePairwiseOnDemand]: 160/169 looper letters, 14 selfloop transitions, 21 changer transitions 15/76 dead transitions. [2020-10-16 05:11:02,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 76 transitions, 886 flow [2020-10-16 05:11:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:11:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:11:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 874 transitions. [2020-10-16 05:11:02,312 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6464497041420119 [2020-10-16 05:11:02,313 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 874 transitions. [2020-10-16 05:11:02,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 874 transitions. [2020-10-16 05:11:02,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:11:02,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 874 transitions. [2020-10-16 05:11:02,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:11:02,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:11:02,316 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:11:02,316 INFO L185 Difference]: Start difference. First operand has 89 places, 75 transitions, 772 flow. Second operand 8 states and 874 transitions. [2020-10-16 05:11:02,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 76 transitions, 886 flow [2020-10-16 05:11:02,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 76 transitions, 877 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 05:11:02,326 INFO L241 Difference]: Finished difference. Result has 94 places, 61 transitions, 618 flow [2020-10-16 05:11:02,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=618, PETRI_PLACES=94, PETRI_TRANSITIONS=61} [2020-10-16 05:11:02,327 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 61 predicate places. [2020-10-16 05:11:02,327 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 61 transitions, 618 flow [2020-10-16 05:11:02,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:11:02,327 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:11:02,327 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:11:02,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:11:02,328 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:11:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:11:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash -2066853505, now seen corresponding path program 6 times [2020-10-16 05:11:02,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:11:02,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946902527] [2020-10-16 05:11:02,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:11:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:11:02,511 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:11:02,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946902527] [2020-10-16 05:11:02,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:11:02,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:11:02,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138163931] [2020-10-16 05:11:02,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:11:02,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:11:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:11:02,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:11:02,514 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 169 [2020-10-16 05:11:02,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 61 transitions, 618 flow. Second operand 6 states. [2020-10-16 05:11:02,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:11:02,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 169 [2020-10-16 05:11:02,515 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:11:02,746 INFO L129 PetriNetUnfolder]: 56/223 cut-off events. [2020-10-16 05:11:02,746 INFO L130 PetriNetUnfolder]: For 803/884 co-relation queries the response was YES. [2020-10-16 05:11:02,747 INFO L80 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 223 events. 56/223 cut-off events. For 803/884 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 1332 event pairs, 0 based on Foata normal form. 35/245 useless extension candidates. Maximal degree in co-relation 943. Up to 70 conditions per place. [2020-10-16 05:11:02,748 INFO L132 encePairwiseOnDemand]: 162/169 looper letters, 13 selfloop transitions, 8 changer transitions 19/66 dead transitions. [2020-10-16 05:11:02,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 66 transitions, 769 flow [2020-10-16 05:11:02,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:11:02,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:11:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2020-10-16 05:11:02,750 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6775147928994083 [2020-10-16 05:11:02,750 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2020-10-16 05:11:02,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2020-10-16 05:11:02,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:11:02,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2020-10-16 05:11:02,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:11:02,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:11:02,753 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:11:02,753 INFO L185 Difference]: Start difference. First operand has 94 places, 61 transitions, 618 flow. Second operand 6 states and 687 transitions. [2020-10-16 05:11:02,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 66 transitions, 769 flow [2020-10-16 05:11:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 66 transitions, 641 flow, removed 16 selfloop flow, removed 14 redundant places. [2020-10-16 05:11:02,761 INFO L241 Difference]: Finished difference. Result has 82 places, 47 transitions, 376 flow [2020-10-16 05:11:02,761 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=82, PETRI_TRANSITIONS=47} [2020-10-16 05:11:02,761 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 49 predicate places. [2020-10-16 05:11:02,762 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 47 transitions, 376 flow [2020-10-16 05:11:02,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:11:02,762 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:11:02,762 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:11:02,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 05:11:02,762 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:11:02,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:11:02,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1234577855, now seen corresponding path program 7 times [2020-10-16 05:11:02,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:11:02,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211036444] [2020-10-16 05:11:02,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:11:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:11:02,879 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:11:02,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211036444] [2020-10-16 05:11:02,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:11:02,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:11:02,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98780063] [2020-10-16 05:11:02,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:11:02,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:11:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:11:02,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:11:02,882 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 169 [2020-10-16 05:11:02,882 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 47 transitions, 376 flow. Second operand 6 states. [2020-10-16 05:11:02,882 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:11:02,883 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 169 [2020-10-16 05:11:02,883 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:11:03,000 INFO L129 PetriNetUnfolder]: 35/140 cut-off events. [2020-10-16 05:11:03,000 INFO L130 PetriNetUnfolder]: For 374/429 co-relation queries the response was YES. [2020-10-16 05:11:03,001 INFO L80 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 140 events. 35/140 cut-off events. For 374/429 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 679 event pairs, 0 based on Foata normal form. 25/157 useless extension candidates. Maximal degree in co-relation 556. Up to 45 conditions per place. [2020-10-16 05:11:03,002 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 13 selfloop transitions, 5 changer transitions 12/54 dead transitions. [2020-10-16 05:11:03,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 54 transitions, 506 flow [2020-10-16 05:11:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:11:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:11:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2020-10-16 05:11:03,008 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7092138630600169 [2020-10-16 05:11:03,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2020-10-16 05:11:03,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2020-10-16 05:11:03,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:11:03,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2020-10-16 05:11:03,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:11:03,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:11:03,011 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:11:03,011 INFO L185 Difference]: Start difference. First operand has 82 places, 47 transitions, 376 flow. Second operand 7 states and 839 transitions. [2020-10-16 05:11:03,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 54 transitions, 506 flow [2020-10-16 05:11:03,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 54 transitions, 416 flow, removed 14 selfloop flow, removed 15 redundant places. [2020-10-16 05:11:03,015 INFO L241 Difference]: Finished difference. Result has 71 places, 42 transitions, 283 flow [2020-10-16 05:11:03,016 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2020-10-16 05:11:03,016 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2020-10-16 05:11:03,016 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 283 flow [2020-10-16 05:11:03,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:11:03,016 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:11:03,016 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:11:03,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 05:11:03,017 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:11:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:11:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2042720303, now seen corresponding path program 8 times [2020-10-16 05:11:03,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:11:03,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901458627] [2020-10-16 05:11:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:11:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:11:03,122 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:11:03,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901458627] [2020-10-16 05:11:03,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:11:03,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:11:03,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383214086] [2020-10-16 05:11:03,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:11:03,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:11:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:11:03,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:11:03,125 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 169 [2020-10-16 05:11:03,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 42 transitions, 283 flow. Second operand 6 states. [2020-10-16 05:11:03,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:11:03,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 169 [2020-10-16 05:11:03,126 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:11:03,309 INFO L129 PetriNetUnfolder]: 20/99 cut-off events. [2020-10-16 05:11:03,309 INFO L130 PetriNetUnfolder]: For 203/244 co-relation queries the response was YES. [2020-10-16 05:11:03,309 INFO L80 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 99 events. 20/99 cut-off events. For 203/244 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 405 event pairs, 0 based on Foata normal form. 17/111 useless extension candidates. Maximal degree in co-relation 359. Up to 27 conditions per place. [2020-10-16 05:11:03,310 INFO L132 encePairwiseOnDemand]: 163/169 looper letters, 8 selfloop transitions, 4 changer transitions 11/45 dead transitions. [2020-10-16 05:11:03,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 45 transitions, 346 flow [2020-10-16 05:11:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:11:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:11:03,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions. [2020-10-16 05:11:03,312 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.703155818540434 [2020-10-16 05:11:03,312 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 713 transitions. [2020-10-16 05:11:03,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 713 transitions. [2020-10-16 05:11:03,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:11:03,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 713 transitions. [2020-10-16 05:11:03,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:11:03,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:11:03,314 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:11:03,314 INFO L185 Difference]: Start difference. First operand has 71 places, 42 transitions, 283 flow. Second operand 6 states and 713 transitions. [2020-10-16 05:11:03,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 45 transitions, 346 flow [2020-10-16 05:11:03,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 45 transitions, 314 flow, removed 3 selfloop flow, removed 8 redundant places. [2020-10-16 05:11:03,316 INFO L241 Difference]: Finished difference. Result has 64 places, 34 transitions, 200 flow [2020-10-16 05:11:03,316 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=64, PETRI_TRANSITIONS=34} [2020-10-16 05:11:03,316 INFO L342 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2020-10-16 05:11:03,316 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 34 transitions, 200 flow [2020-10-16 05:11:03,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:11:03,317 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:11:03,317 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:11:03,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 05:11:03,317 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:11:03,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:11:03,317 INFO L82 PathProgramCache]: Analyzing trace with hash 443558157, now seen corresponding path program 9 times [2020-10-16 05:11:03,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:11:03,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036597963] [2020-10-16 05:11:03,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:11:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:11:03,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:11:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:11:03,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:11:03,484 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:11:03,484 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:11:03,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 05:11:03,486 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:11:03,506 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1649] [1649] L3-->L854: Formula: (let ((.cse6 (= (mod ~x$r_buff1_thd0~0_In-1870762036 256) 0)) (.cse7 (= (mod ~x$w_buff1_used~0_In-1870762036 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In-1870762036 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In-1870762036 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (or (and .cse0 (or (and (= ~x~0_Out-1870762036 ~x$w_buff1~0_In-1870762036) .cse1 .cse2) (and (= ~x~0_In-1870762036 ~x~0_Out-1870762036) .cse3))) (and (= ~x$w_buff0~0_In-1870762036 ~x~0_Out-1870762036) .cse4 .cse5)) (= ~x$r_buff0_thd0~0_Out-1870762036 ~x$r_buff0_thd0~0_In-1870762036) (= ~x$r_buff1_thd0~0_In-1870762036 ~x$r_buff1_thd0~0_Out-1870762036) (or (and .cse0 (= ~x$w_buff0_used~0_In-1870762036 ~x$w_buff0_used~0_Out-1870762036)) (and (= ~x$w_buff0_used~0_Out-1870762036 0) .cse4 .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1870762036 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1870762036| ULTIMATE.start_assume_abort_if_not_~cond_Out-1870762036) (or (and (= ~x$w_buff1_used~0_Out-1870762036 ~x$w_buff1_used~0_In-1870762036) .cse3) (and .cse1 (= ~x$w_buff1_used~0_Out-1870762036 0) .cse2))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1870762036, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1870762036, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1870762036|, ~x$w_buff1~0=~x$w_buff1~0_In-1870762036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1870762036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1870762036, ~x~0=~x~0_In-1870762036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1870762036} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1870762036, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1870762036, ~x$w_buff1~0=~x$w_buff1~0_In-1870762036, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1870762036, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-1870762036|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1870762036, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1870762036, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-1870762036|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-1870762036|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1870762036|, ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-1870762036|, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1870762036|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1870762036, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-1870762036|, ~x~0=~x~0_Out-1870762036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite70, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite69, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-16 05:11:03,514 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:11:03,514 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,515 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:11:03,515 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,516 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:11:03,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,516 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:11:03,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,516 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:11:03,516 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,517 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:11:03,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,517 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:11:03,517 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,518 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:11:03,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,518 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:11:03,518 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,518 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:11:03,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,519 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:11:03,519 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,519 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:11:03,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,520 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:11:03,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,521 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:11:03,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,521 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:11:03,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,521 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:11:03,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,522 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:11:03,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,522 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:11:03,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,522 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:11:03,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,523 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:11:03,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,523 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:11:03,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,523 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:11:03,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,524 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:11:03,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,524 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:11:03,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,524 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:11:03,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,525 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:11:03,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,525 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:11:03,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,525 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:11:03,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,526 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:11:03,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,526 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:11:03,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,526 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:11:03,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,527 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:11:03,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,527 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:11:03,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,527 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:11:03,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,528 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:11:03,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,528 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:11:03,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,529 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:11:03,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,529 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:11:03,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,529 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:11:03,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,530 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:11:03,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,530 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:11:03,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,531 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:11:03,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,531 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:11:03,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,531 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:11:03,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,532 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:11:03,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,533 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:11:03,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,534 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:11:03,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,534 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:11:03,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,534 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:11:03,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,535 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:11:03,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,535 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:11:03,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,536 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:11:03,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,536 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:11:03,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,536 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:11:03,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,537 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:11:03,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,537 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:11:03,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,538 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:11:03,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:11:03,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:11:03 BasicIcfg [2020-10-16 05:11:03,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:11:03,611 INFO L168 Benchmark]: Toolchain (without parser) took 32286.15 ms. Allocated memory was 253.2 MB in the beginning and 1.0 GB in the end (delta: 748.2 MB). Free memory was 205.2 MB in the beginning and 400.8 MB in the end (delta: -195.6 MB). Peak memory consumption was 552.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:11:03,612 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 253.2 MB. Free memory was 228.8 MB in the beginning and 227.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 05:11:03,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 912.71 ms. Allocated memory was 253.2 MB in the beginning and 318.8 MB in the end (delta: 65.5 MB). Free memory was 205.2 MB in the beginning and 267.2 MB in the end (delta: -62.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 14.2 GB. [2020-10-16 05:11:03,615 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.98 ms. Allocated memory is still 318.8 MB. Free memory was 267.2 MB in the beginning and 264.7 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:11:03,615 INFO L168 Benchmark]: Boogie Preprocessor took 65.22 ms. Allocated memory is still 318.8 MB. Free memory was 264.7 MB in the beginning and 261.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 05:11:03,616 INFO L168 Benchmark]: RCFGBuilder took 3659.01 ms. Allocated memory was 318.8 MB in the beginning and 371.7 MB in the end (delta: 53.0 MB). Free memory was 261.3 MB in the beginning and 168.3 MB in the end (delta: 93.0 MB). Peak memory consumption was 145.9 MB. Max. memory is 14.2 GB. [2020-10-16 05:11:03,617 INFO L168 Benchmark]: TraceAbstraction took 27553.08 ms. Allocated memory was 371.7 MB in the beginning and 1.0 GB in the end (delta: 629.7 MB). Free memory was 168.3 MB in the beginning and 400.8 MB in the end (delta: -232.5 MB). Peak memory consumption was 397.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:11:03,622 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.38 ms. Allocated memory is still 253.2 MB. Free memory was 228.8 MB in the beginning and 227.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 912.71 ms. Allocated memory was 253.2 MB in the beginning and 318.8 MB in the end (delta: 65.5 MB). Free memory was 205.2 MB in the beginning and 267.2 MB in the end (delta: -62.0 MB). Peak memory consumption was 31.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 85.98 ms. Allocated memory is still 318.8 MB. Free memory was 267.2 MB in the beginning and 264.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 65.22 ms. Allocated memory is still 318.8 MB. Free memory was 264.7 MB in the beginning and 261.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3659.01 ms. Allocated memory was 318.8 MB in the beginning and 371.7 MB in the end (delta: 53.0 MB). Free memory was 261.3 MB in the beginning and 168.3 MB in the end (delta: 93.0 MB). Peak memory consumption was 145.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 27553.08 ms. Allocated memory was 371.7 MB in the beginning and 1.0 GB in the end (delta: 629.7 MB). Free memory was 168.3 MB in the beginning and 400.8 MB in the end (delta: -232.5 MB). Peak memory consumption was 397.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 965 VarBasedMoverChecksPositive, 98 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 5.9s, 86 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 13.4s, 97 PlacesBefore, 33 PlacesAfterwards, 89 TransitionsBefore, 24 TransitionsAfterwards, 1624 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 4587 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L704] 0 _Bool main$tmp_guard0; [L705] 0 _Bool main$tmp_guard1; [L707] 0 int x = 0; [L708] 0 _Bool x$flush_delayed; [L709] 0 int x$mem_tmp; [L710] 0 _Bool x$r_buff0_thd0; [L711] 0 _Bool x$r_buff0_thd1; [L712] 0 _Bool x$r_buff0_thd2; [L713] 0 _Bool x$r_buff0_thd3; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$r_buff1_thd3; [L718] 0 _Bool x$read_delayed; [L719] 0 int *x$read_delayed_var; [L720] 0 int x$w_buff0; [L721] 0 _Bool x$w_buff0_used; [L722] 0 int x$w_buff1; [L723] 0 _Bool x$w_buff1_used; [L725] 0 int y = 0; [L726] 0 _Bool weak$$choice0; [L727] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2549; [L839] FCALL, FORK 0 pthread_create(&t2549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2550; [L841] FCALL, FORK 0 pthread_create(&t2550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2551; [L843] FCALL, FORK 0 pthread_create(&t2551, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff1 = x$w_buff0 [L802] 3 x$w_buff0 = 2 [L803] 3 x$w_buff1_used = x$w_buff0_used [L804] 3 x$w_buff0_used = (_Bool)1 [L8] COND FALSE 3 !(!expression) [L806] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L807] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L808] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L809] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L737] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L738] 1 x$flush_delayed = weak$$choice2 [L739] 1 x$mem_tmp = x [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L740] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L741] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L742] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L743] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L744] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L745] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L746] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 __unbuffered_p0_EAX = x [L748] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L748] 1 x = x$flush_delayed ? x$mem_tmp : x [L749] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, 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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x [L775] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L775] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L777] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L780] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L780] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x [L783] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 x$flush_delayed = weak$$choice2 [L859] 0 x$mem_tmp = x [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L860] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L860] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L861] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L861] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L862] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L862] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L863] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L865] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L868] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L868] 0 x = x$flush_delayed ? x$mem_tmp : x [L869] 0 x$flush_delayed = (_Bool)0 [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 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: 27.1s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.5s, HoareTripleCheckerStatistics: 68 SDtfs, 88 SDslu, 32 SDs, 0 SdLazy, 854 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1047occurred in iteration=10, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 369 NumberOfCodeBlocks, 369 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 76993 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...