/usr/bin/java -Xmx8000000000 -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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:27:21,274 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:27:21,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:27:21,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:27:21,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:27:21,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:27:21,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:27:21,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:27:21,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:27:21,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:27:21,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:27:21,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:27:21,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:27:21,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:27:21,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:27:21,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:27:21,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:27:21,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:27:21,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:27:21,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:27:21,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:27:21,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:27:21,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:27:21,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:27:21,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:27:21,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:27:21,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:27:21,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:27:21,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:27:21,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:27:21,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:27:21,330 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:27:21,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:27:21,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:27:21,332 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:27:21,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:27:21,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:27:21,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:27:21,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:27:21,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:27:21,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:27:21,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 00:27:21,364 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:27:21,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:27:21,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:27:21,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:27:21,366 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:27:21,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:27:21,367 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:27:21,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:27:21,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:27:21,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:27:21,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:27:21,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:27:21,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:27:21,368 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:27:21,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:27:21,368 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:27:21,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:27:21,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:27:21,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:27:21,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:27:21,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:27:21,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:27:21,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:27:21,370 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:27:21,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:27:21,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:27:21,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:27:21,371 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:27:21,371 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:27:21,371 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:27:21,372 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:27:21,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:27:21,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:27:21,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:27:21,682 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:27:21,683 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:27:21,684 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2020-10-06 00:27:21,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d7567ac/da6175421d834ba49bda8880527174ba/FLAGa4ac86e72 [2020-10-06 00:27:22,374 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:27:22,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt.i [2020-10-06 00:27:22,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d7567ac/da6175421d834ba49bda8880527174ba/FLAGa4ac86e72 [2020-10-06 00:27:22,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93d7567ac/da6175421d834ba49bda8880527174ba [2020-10-06 00:27:22,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:27:22,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:27:22,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:27:22,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:27:22,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:27:22,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:27:22" (1/1) ... [2020-10-06 00:27:22,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d969862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:22, skipping insertion in model container [2020-10-06 00:27:22,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:27:22" (1/1) ... [2020-10-06 00:27:22,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:27:22,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:27:23,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:27:23,299 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:27:23,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:27:23,447 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:27:23,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23 WrapperNode [2020-10-06 00:27:23,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:27:23,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:27:23,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:27:23,449 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:27:23,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:27:23,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:27:23,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:27:23,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:27:23,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (1/1) ... [2020-10-06 00:27:23,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:27:23,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:27:23,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:27:23,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:27:23,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (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-06 00:27:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:27:23,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:27:23,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:27:23,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:27:23,649 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:27:23,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:27:23,650 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:27:23,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:27:23,653 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 00:27:23,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 00:27:23,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:27:23,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:27:23,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:27:23,656 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:27:25,744 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:27:25,744 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:27:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:27:25 BoogieIcfgContainer [2020-10-06 00:27:25,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:27:25,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:27:25,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:27:25,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:27:25,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:27:22" (1/3) ... [2020-10-06 00:27:25,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f73fa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:27:25, skipping insertion in model container [2020-10-06 00:27:25,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:27:23" (2/3) ... [2020-10-06 00:27:25,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f73fa0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:27:25, skipping insertion in model container [2020-10-06 00:27:25,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:27:25" (3/3) ... [2020-10-06 00:27:25,757 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_power.opt.i [2020-10-06 00:27:25,768 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:27:25,768 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:27:25,777 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:27:25,778 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:27:25,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,810 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,819 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,820 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,820 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,824 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,831 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,833 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,834 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,835 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,836 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,839 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,839 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,840 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,846 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,846 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,846 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,847 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:27:25,862 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 00:27:25,883 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:27:25,883 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:27:25,883 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:27:25,884 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:27:25,884 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:27:25,884 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:27:25,884 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:27:25,884 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:27:25,900 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 211 flow [2020-10-06 00:27:25,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2020-10-06 00:27:25,950 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2020-10-06 00:27:25,950 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:27:25,955 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-06 00:27:25,959 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2020-10-06 00:27:25,983 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2020-10-06 00:27:25,984 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:27:25,984 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-06 00:27:25,987 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1824 [2020-10-06 00:27:25,988 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:27:27,272 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-06 00:27:28,154 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-06 00:27:28,267 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-06 00:27:28,276 INFO L206 etLargeBlockEncoding]: Checked pairs total: 4960 [2020-10-06 00:27:28,277 INFO L214 etLargeBlockEncoding]: Total number of compositions: 79 [2020-10-06 00:27:28,283 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-06 00:27:28,390 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1332 states. [2020-10-06 00:27:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states. [2020-10-06 00:27:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-06 00:27:28,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:28,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-06 00:27:28,422 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:28,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:28,432 INFO L82 PathProgramCache]: Analyzing trace with hash 929818262, now seen corresponding path program 1 times [2020-10-06 00:27:28,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:28,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123741439] [2020-10-06 00:27:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:28,679 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-06 00:27:28,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123741439] [2020-10-06 00:27:28,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:28,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:27:28,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1912317601] [2020-10-06 00:27:28,683 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:28,686 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:28,698 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-06 00:27:28,699 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:28,703 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:27:28,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:27:28,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:28,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:27:28,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:27:28,719 INFO L87 Difference]: Start difference. First operand 1332 states. Second operand 3 states. [2020-10-06 00:27:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:28,871 INFO L93 Difference]: Finished difference Result 1112 states and 3605 transitions. [2020-10-06 00:27:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:27:28,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-06 00:27:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:28,899 INFO L225 Difference]: With dead ends: 1112 [2020-10-06 00:27:28,899 INFO L226 Difference]: Without dead ends: 812 [2020-10-06 00:27:28,900 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:27:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-06 00:27:28,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-10-06 00:27:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-10-06 00:27:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2020-10-06 00:27:29,010 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2020-10-06 00:27:29,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:29,011 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2020-10-06 00:27:29,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:27:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2020-10-06 00:27:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 00:27:29,013 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:29,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:29,014 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:27:29,014 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:29,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1433744580, now seen corresponding path program 1 times [2020-10-06 00:27:29,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:29,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366578643] [2020-10-06 00:27:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:29,140 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-06 00:27:29,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366578643] [2020-10-06 00:27:29,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:29,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:27:29,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [189491411] [2020-10-06 00:27:29,141 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:29,142 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:29,144 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-06 00:27:29,145 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:29,145 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:27:29,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:27:29,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:27:29,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:27:29,147 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 4 states. [2020-10-06 00:27:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:29,184 INFO L93 Difference]: Finished difference Result 942 states and 2874 transitions. [2020-10-06 00:27:29,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:27:29,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-06 00:27:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:29,192 INFO L225 Difference]: With dead ends: 942 [2020-10-06 00:27:29,192 INFO L226 Difference]: Without dead ends: 792 [2020-10-06 00:27:29,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:27:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-10-06 00:27:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2020-10-06 00:27:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-10-06 00:27:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2499 transitions. [2020-10-06 00:27:29,221 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2499 transitions. Word has length 10 [2020-10-06 00:27:29,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:29,223 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 2499 transitions. [2020-10-06 00:27:29,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:27:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2499 transitions. [2020-10-06 00:27:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:27:29,225 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:29,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:29,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:27:29,226 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:29,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1546465282, now seen corresponding path program 1 times [2020-10-06 00:27:29,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:29,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214206052] [2020-10-06 00:27:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:29,300 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-06 00:27:29,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214206052] [2020-10-06 00:27:29,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:29,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:27:29,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [176524944] [2020-10-06 00:27:29,302 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:29,303 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:29,305 INFO L258 McrAutomatonBuilder]: Finished intersection with 14 states and 15 transitions. [2020-10-06 00:27:29,305 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:29,332 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:27:29,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:27:29,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:29,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:27:29,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:27:29,333 INFO L87 Difference]: Start difference. First operand 792 states and 2499 transitions. Second operand 4 states. [2020-10-06 00:27:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:29,359 INFO L93 Difference]: Finished difference Result 852 states and 2592 transitions. [2020-10-06 00:27:29,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:27:29,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-06 00:27:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:29,366 INFO L225 Difference]: With dead ends: 852 [2020-10-06 00:27:29,366 INFO L226 Difference]: Without dead ends: 712 [2020-10-06 00:27:29,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:27:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2020-10-06 00:27:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2020-10-06 00:27:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-10-06 00:27:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2215 transitions. [2020-10-06 00:27:29,391 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2215 transitions. Word has length 11 [2020-10-06 00:27:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:29,392 INFO L479 AbstractCegarLoop]: Abstraction has 712 states and 2215 transitions. [2020-10-06 00:27:29,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:27:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2215 transitions. [2020-10-06 00:27:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:27:29,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:29,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:29,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:27:29,395 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:29,396 INFO L82 PathProgramCache]: Analyzing trace with hash -756922000, now seen corresponding path program 1 times [2020-10-06 00:27:29,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:29,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582506819] [2020-10-06 00:27:29,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:29,457 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-06 00:27:29,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582506819] [2020-10-06 00:27:29,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:29,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 00:27:29,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [176248499] [2020-10-06 00:27:29,458 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:29,460 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:29,462 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-10-06 00:27:29,462 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:29,485 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:27:29,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:27:29,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:27:29,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:27:29,487 INFO L87 Difference]: Start difference. First operand 712 states and 2215 transitions. Second operand 4 states. [2020-10-06 00:27:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:29,513 INFO L93 Difference]: Finished difference Result 732 states and 2206 transitions. [2020-10-06 00:27:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:27:29,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-06 00:27:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:29,520 INFO L225 Difference]: With dead ends: 732 [2020-10-06 00:27:29,520 INFO L226 Difference]: Without dead ends: 632 [2020-10-06 00:27:29,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:27:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2020-10-06 00:27:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2020-10-06 00:27:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2020-10-06 00:27:29,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1931 transitions. [2020-10-06 00:27:29,543 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1931 transitions. Word has length 12 [2020-10-06 00:27:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:29,544 INFO L479 AbstractCegarLoop]: Abstraction has 632 states and 1931 transitions. [2020-10-06 00:27:29,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:27:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1931 transitions. [2020-10-06 00:27:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 00:27:29,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:29,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:29,546 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:27:29,546 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:29,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:29,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1144835858, now seen corresponding path program 1 times [2020-10-06 00:27:29,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:29,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623292555] [2020-10-06 00:27:29,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:29,614 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-06 00:27:29,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623292555] [2020-10-06 00:27:29,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:29,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:27:29,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [588503567] [2020-10-06 00:27:29,615 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:29,617 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:29,624 INFO L258 McrAutomatonBuilder]: Finished intersection with 43 states and 78 transitions. [2020-10-06 00:27:29,624 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:29,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:29,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:29,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:29,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:29,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:29,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:29,853 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:27:29,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:27:29,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:29,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:27:29,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:27:29,854 INFO L87 Difference]: Start difference. First operand 632 states and 1931 transitions. Second operand 4 states. [2020-10-06 00:27:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:29,893 INFO L93 Difference]: Finished difference Result 574 states and 1544 transitions. [2020-10-06 00:27:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:27:29,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-06 00:27:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:29,897 INFO L225 Difference]: With dead ends: 574 [2020-10-06 00:27:29,897 INFO L226 Difference]: Without dead ends: 424 [2020-10-06 00:27:29,898 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:27:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-10-06 00:27:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2020-10-06 00:27:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-10-06 00:27:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1099 transitions. [2020-10-06 00:27:29,910 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1099 transitions. Word has length 14 [2020-10-06 00:27:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:29,910 INFO L479 AbstractCegarLoop]: Abstraction has 424 states and 1099 transitions. [2020-10-06 00:27:29,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:27:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1099 transitions. [2020-10-06 00:27:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:27:29,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:29,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:29,912 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:27:29,912 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:29,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1358243248, now seen corresponding path program 1 times [2020-10-06 00:27:29,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:29,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736200957] [2020-10-06 00:27:29,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:30,007 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-06 00:27:30,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736200957] [2020-10-06 00:27:30,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:30,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:27:30,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1138976541] [2020-10-06 00:27:30,009 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:30,012 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:30,021 INFO L258 McrAutomatonBuilder]: Finished intersection with 45 states and 72 transitions. [2020-10-06 00:27:30,021 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:30,224 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13761#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 00:27:30,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:27:30,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:30,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:27:30,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:27:30,225 INFO L87 Difference]: Start difference. First operand 424 states and 1099 transitions. Second operand 6 states. [2020-10-06 00:27:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:30,273 INFO L93 Difference]: Finished difference Result 330 states and 788 transitions. [2020-10-06 00:27:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:27:30,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-06 00:27:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:30,275 INFO L225 Difference]: With dead ends: 330 [2020-10-06 00:27:30,275 INFO L226 Difference]: Without dead ends: 260 [2020-10-06 00:27:30,276 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:27:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2020-10-06 00:27:30,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2020-10-06 00:27:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-10-06 00:27:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 607 transitions. [2020-10-06 00:27:30,283 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 607 transitions. Word has length 16 [2020-10-06 00:27:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:30,284 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 607 transitions. [2020-10-06 00:27:30,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:27:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 607 transitions. [2020-10-06 00:27:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 00:27:30,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:30,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:30,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:27:30,285 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:30,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:30,286 INFO L82 PathProgramCache]: Analyzing trace with hash 963341184, now seen corresponding path program 1 times [2020-10-06 00:27:30,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:30,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081028295] [2020-10-06 00:27:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:27:30,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081028295] [2020-10-06 00:27:30,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:30,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:27:30,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971664805] [2020-10-06 00:27:30,370 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:30,375 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:30,387 INFO L258 McrAutomatonBuilder]: Finished intersection with 48 states and 75 transitions. [2020-10-06 00:27:30,388 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:30,551 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:27:30,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:27:30,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:30,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:27:30,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:27:30,552 INFO L87 Difference]: Start difference. First operand 260 states and 607 transitions. Second operand 5 states. [2020-10-06 00:27:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:30,584 INFO L93 Difference]: Finished difference Result 355 states and 802 transitions. [2020-10-06 00:27:30,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:27:30,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-06 00:27:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:30,588 INFO L225 Difference]: With dead ends: 355 [2020-10-06 00:27:30,588 INFO L226 Difference]: Without dead ends: 266 [2020-10-06 00:27:30,589 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:27:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2020-10-06 00:27:30,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2020-10-06 00:27:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2020-10-06 00:27:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 585 transitions. [2020-10-06 00:27:30,596 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 585 transitions. Word has length 19 [2020-10-06 00:27:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:30,597 INFO L479 AbstractCegarLoop]: Abstraction has 260 states and 585 transitions. [2020-10-06 00:27:30,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:27:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 585 transitions. [2020-10-06 00:27:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 00:27:30,598 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:30,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:30,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:27:30,599 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:30,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:30,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1204306530, now seen corresponding path program 2 times [2020-10-06 00:27:30,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:30,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159081175] [2020-10-06 00:27:30,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:30,727 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-06 00:27:30,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159081175] [2020-10-06 00:27:30,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:30,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:27:30,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [243761994] [2020-10-06 00:27:30,729 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:30,733 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:30,737 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 19 transitions. [2020-10-06 00:27:30,738 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:30,738 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:27:30,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:27:30,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:30,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:27:30,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:27:30,740 INFO L87 Difference]: Start difference. First operand 260 states and 585 transitions. Second operand 6 states. [2020-10-06 00:27:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:30,786 INFO L93 Difference]: Finished difference Result 230 states and 524 transitions. [2020-10-06 00:27:30,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:27:30,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-06 00:27:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:30,788 INFO L225 Difference]: With dead ends: 230 [2020-10-06 00:27:30,788 INFO L226 Difference]: Without dead ends: 108 [2020-10-06 00:27:30,789 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:27:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-06 00:27:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-10-06 00:27:30,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-10-06 00:27:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 223 transitions. [2020-10-06 00:27:30,792 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 223 transitions. Word has length 19 [2020-10-06 00:27:30,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:30,792 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 223 transitions. [2020-10-06 00:27:30,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:27:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 223 transitions. [2020-10-06 00:27:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:27:30,793 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:30,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:30,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:27:30,794 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:30,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash 472021911, now seen corresponding path program 1 times [2020-10-06 00:27:30,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:30,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376591686] [2020-10-06 00:27:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:30,919 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-06 00:27:30,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376591686] [2020-10-06 00:27:30,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:30,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:27:30,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [642795033] [2020-10-06 00:27:30,920 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:30,926 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:30,948 INFO L258 McrAutomatonBuilder]: Finished intersection with 54 states and 78 transitions. [2020-10-06 00:27:30,948 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:30,965 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:30,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:30,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:30,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:30,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:30,970 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:30,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:30,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:30,978 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:27:30,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:30,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:30,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,001 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,003 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:27:31,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,034 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,045 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:31,051 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:27:31,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,053 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,058 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:27:31,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,076 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:27:31,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,096 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:27:31,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,120 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-06 00:27:31,121 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:27:31,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,336 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:27:31,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,337 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:31,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,338 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-06 00:27:31,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,340 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:31,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,341 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:31,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,342 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:31,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,344 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 4, 5, 3, 3, 2, 1] term [2020-10-06 00:27:31,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,345 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:31,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,346 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:31,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:31,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:27:31,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:27:31,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,571 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:27:31,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,572 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:27:31,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:31,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:31,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,645 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:31,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,678 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:27:31,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,735 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:27:31,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,736 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:27:31,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,739 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:31,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:31,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:31,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,767 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:27:31,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,790 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:27:31,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,791 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:27:31,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,793 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:31,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:31,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:31,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,823 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,824 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,832 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,843 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:27:31,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,869 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:27:31,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:27:31,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,871 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:31,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:31,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:31,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,897 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:31,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,918 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:31,920 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:27:31,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,943 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:27:31,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,944 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:27:31,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,946 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:31,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,947 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:31,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,958 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,960 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,968 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:31,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:31,983 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:31,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:31,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,001 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:27:32,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:27:32,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:27:32,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:32,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:32,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,074 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:32,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,146 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:32,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:32,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,246 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:32,251 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:32,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,263 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:27:32,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-06 00:27:32,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-06 00:27:32,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:32,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:32,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:32,332 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-06 00:27:32,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,366 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15958#(and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0)) (not (= ~y$w_buff0~0 0)))] [2020-10-06 00:27:32,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:27:32,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:32,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:27:32,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:27:32,368 INFO L87 Difference]: Start difference. First operand 108 states and 223 transitions. Second operand 7 states. [2020-10-06 00:27:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:32,558 INFO L93 Difference]: Finished difference Result 181 states and 362 transitions. [2020-10-06 00:27:32,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:27:32,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-06 00:27:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:32,561 INFO L225 Difference]: With dead ends: 181 [2020-10-06 00:27:32,561 INFO L226 Difference]: Without dead ends: 145 [2020-10-06 00:27:32,561 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:27:32,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-06 00:27:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 120. [2020-10-06 00:27:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-06 00:27:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 245 transitions. [2020-10-06 00:27:32,568 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 245 transitions. Word has length 23 [2020-10-06 00:27:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:32,568 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 245 transitions. [2020-10-06 00:27:32,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:27:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 245 transitions. [2020-10-06 00:27:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:27:32,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:32,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:32,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:27:32,571 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:32,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1272026487, now seen corresponding path program 2 times [2020-10-06 00:27:32,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:32,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486329592] [2020-10-06 00:27:32,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:27:32,849 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-06 00:27:32,850 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486329592] [2020-10-06 00:27:32,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:27:32,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:27:32,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1205448124] [2020-10-06 00:27:32,851 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:27:32,855 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:27:32,882 INFO L258 McrAutomatonBuilder]: Finished intersection with 61 states and 94 transitions. [2020-10-06 00:27:32,883 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:27:32,933 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:27:32,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:32,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-06 00:27:32,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,936 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 5, 3, 3, 2, 1] term [2020-10-06 00:27:32,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,937 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:32,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,937 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:32,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:32,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,940 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:32,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:32,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:32,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:32,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:32,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:32,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:32,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,096 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-06 00:27:33,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,219 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:33,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-06 00:27:33,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:33,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,223 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:33,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,225 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:33,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 4, 5, 3, 3, 2, 1] term [2020-10-06 00:27:33,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,228 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:33,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,230 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-06 00:27:33,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,529 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,569 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:33,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,570 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:33,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,572 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:33,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:33,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:33,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 2, 4, 1] term [2020-10-06 00:27:33,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,590 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:27:33,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,607 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:27:33,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 4, 1] term [2020-10-06 00:27:33,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,624 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,630 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,637 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,642 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,650 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:33,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,657 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:33,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:27:33,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,718 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:27:33,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,732 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-06 00:27:33,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:27:33,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,766 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,778 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:27:33,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:33,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:33,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,818 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:33,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,819 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:33,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,821 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:33,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,823 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 2, 4, 1] term [2020-10-06 00:27:33,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,832 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:27:33,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,852 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:27:33,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 4, 1] term [2020-10-06 00:27:33,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,873 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,879 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,887 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,893 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:33,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,902 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:33,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,908 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:33,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:27:33,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:33,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:27:33,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:33,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:33,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:33,999 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:34,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,010 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-06 00:27:34,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:27:34,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,073 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:34,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,074 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:34,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,077 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:34,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,078 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:34,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,079 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:34,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,082 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,082 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:27:34,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,083 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,106 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:27:34,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,122 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 4, 1] term [2020-10-06 00:27:34,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,124 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:34,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,129 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:34,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,135 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:34,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,140 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:34,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,148 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,154 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,172 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:27:34,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:27:34,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,234 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,235 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:27:34,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,245 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-06 00:27:34,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,262 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:27:34,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:27:34,307 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:34,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,308 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:34,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:34,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:34,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:34,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,316 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,332 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,340 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,355 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,366 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,601 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 26 [2020-10-06 00:27:34,606 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:34,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:34,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:34,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:34,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:34,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,614 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,624 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 4, 1] term [2020-10-06 00:27:34,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,639 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,679 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,739 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:34,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,740 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:34,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,741 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:34,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,743 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:34,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,744 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:34,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,744 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,758 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,763 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,776 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,786 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,840 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:34,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,841 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:34,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,844 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:34,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,846 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:34,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,847 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:34,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,851 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,856 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,881 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,891 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,938 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:34,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:34,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,940 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:34,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,942 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:34,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,943 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:34,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,944 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 2, 4, 1] term [2020-10-06 00:27:34,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,945 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,951 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,953 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,963 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 2, 4, 1] term [2020-10-06 00:27:34,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:34,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:34,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,976 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:34,982 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:34,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,030 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:35,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:35,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,033 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:35,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,034 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:35,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:35,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,036 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 2, 4, 1] term [2020-10-06 00:27:35,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,049 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:35,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,054 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:35,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-06 00:27:35,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,075 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:35,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 00:27:35,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 00:27:35,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:27:35,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-06 00:27:35,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,171 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-06 00:27:35,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,171 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 4, 1] term [2020-10-06 00:27:35,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,185 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:35,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,191 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:35,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,202 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 2, 4, 1] term [2020-10-06 00:27:35,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:27:35,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:27:35,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,212 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:27:35,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:27:35,261 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [16392#(and (or (= (mod ~y$w_buff0_used~0 256) 0) (and (= (mod ~y$w_buff1_used~0 256) 0) (not (= ~y$w_buff0~0 0)))) (not (= ~y~0 0))), 16393#(and (<= ~y$w_buff1_used~0 0) (or (and (not (= (mod ~y$r_buff0_thd2~0 256) 0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (not (= ~y~0 0))) (not (= ~y$w_buff0~0 0)) (< 0 (+ (div ~y$w_buff1_used~0 256) 1))), 16394#(or (and (<= ~y$w_buff0_used~0 0) (< 0 (+ (div ~y$w_buff0_used~0 256) 1))) (not (= (mod ~y$w_buff0_used~0 256) 0)))] [2020-10-06 00:27:35,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 00:27:35,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:27:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 00:27:35,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-06 00:27:35,263 INFO L87 Difference]: Start difference. First operand 120 states and 245 transitions. Second operand 11 states. [2020-10-06 00:27:35,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:27:35,689 INFO L93 Difference]: Finished difference Result 182 states and 349 transitions. [2020-10-06 00:27:35,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-06 00:27:35,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-10-06 00:27:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:27:35,691 INFO L225 Difference]: With dead ends: 182 [2020-10-06 00:27:35,691 INFO L226 Difference]: Without dead ends: 120 [2020-10-06 00:27:35,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2020-10-06 00:27:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-10-06 00:27:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 80. [2020-10-06 00:27:35,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-06 00:27:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 155 transitions. [2020-10-06 00:27:35,695 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 155 transitions. Word has length 23 [2020-10-06 00:27:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:27:35,696 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 155 transitions. [2020-10-06 00:27:35,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 00:27:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 155 transitions. [2020-10-06 00:27:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:27:35,696 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:27:35,697 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:27:35,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:27:35,697 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:27:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:27:35,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1744590087, now seen corresponding path program 3 times [2020-10-06 00:27:35,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:27:35,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513011261] [2020-10-06 00:27:35,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:27:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:27:35,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:27:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:27:35,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:27:35,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:27:35,877 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:27:35,877 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 00:27:35,935 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-06 00:27:35,935 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,943 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-06 00:27:35,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,943 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-06 00:27:35,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,944 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-06 00:27:35,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,944 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-06 00:27:35,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,945 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-06 00:27:35,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,946 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-06 00:27:35,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,947 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-06 00:27:35,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,947 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-06 00:27:35,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,948 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-06 00:27:35,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,949 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-06 00:27:35,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,949 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-06 00:27:35,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,950 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-06 00:27:35,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,951 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-06 00:27:35,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,951 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-06 00:27:35,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,952 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-06 00:27:35,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,953 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-06 00:27:35,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,953 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-06 00:27:35,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,960 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-06 00:27:35,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,961 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-06 00:27:35,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,961 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-06 00:27:35,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,962 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-06 00:27:35,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,963 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-06 00:27:35,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,963 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-06 00:27:35,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,964 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-06 00:27:35,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,964 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-06 00:27:35,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,966 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-06 00:27:35,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,966 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-06 00:27:35,966 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,967 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-06 00:27:35,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,967 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-06 00:27:35,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:35,967 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-06 00:27:35,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:27:36,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:27:36 BasicIcfg [2020-10-06 00:27:36,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:27:36,096 INFO L168 Benchmark]: Toolchain (without parser) took 13435.56 ms. Allocated memory was 139.5 MB in the beginning and 512.2 MB in the end (delta: 372.8 MB). Free memory was 101.1 MB in the beginning and 232.2 MB in the end (delta: -131.1 MB). Peak memory consumption was 241.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:27:36,097 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 00:27:36,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.78 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 100.7 MB in the beginning and 155.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2020-10-06 00:27:36,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.96 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 151.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-06 00:27:36,102 INFO L168 Benchmark]: Boogie Preprocessor took 58.16 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:27:36,108 INFO L168 Benchmark]: RCFGBuilder took 2174.41 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 149.9 MB in the beginning and 194.2 MB in the end (delta: -44.3 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. [2020-10-06 00:27:36,109 INFO L168 Benchmark]: TraceAbstraction took 10345.62 ms. Allocated memory was 249.0 MB in the beginning and 512.2 MB in the end (delta: 263.2 MB). Free memory was 194.2 MB in the beginning and 232.2 MB in the end (delta: -38.0 MB). Peak memory consumption was 225.2 MB. Max. memory is 7.1 GB. [2020-10-06 00:27:36,124 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.19 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 786.78 ms. Allocated memory was 139.5 MB in the beginning and 201.3 MB in the end (delta: 61.9 MB). Free memory was 100.7 MB in the beginning and 155.2 MB in the end (delta: -54.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.96 ms. Allocated memory is still 201.3 MB. Free memory was 155.2 MB in the beginning and 151.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.16 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2174.41 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 149.9 MB in the beginning and 194.2 MB in the end (delta: -44.3 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10345.62 ms. Allocated memory was 249.0 MB in the beginning and 512.2 MB in the end (delta: 263.2 MB). Free memory was 194.2 MB in the beginning and 232.2 MB in the end (delta: -38.0 MB). Peak memory consumption was 225.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.3s, 106 ProgramPointsBefore, 39 ProgramPointsAfterwards, 98 TransitionsBefore, 30 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 964 VarBasedMoverChecksPositive, 26 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 4960 CheckedPairsTotal, 79 TotalNumberOfCompositions - 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_p0_EBX = 0; [L705] 0 int __unbuffered_p2_EAX = 0; [L707] 0 int __unbuffered_p2_EBX = 0; [L709] 0 int a = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L833] 0 pthread_t t636; [L834] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t637; [L836] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L837] 0 pthread_t t638; [L838] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L739] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0: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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 [L745] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L752] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L752] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L753] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L753] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L753] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L754] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L754] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L755] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L755] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L756] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L756] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L757] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L758] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L758] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 __unbuffered_p0_EBX = y [L760] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 348 SDtfs, 318 SDslu, 820 SDs, 0 SdLazy, 261 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 100 SyntacticMatches, 37 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1332occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 13136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...