/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 01:32:31,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 01:32:31,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 01:32:31,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 01:32:31,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 01:32:31,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 01:32:31,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 01:32:31,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 01:32:31,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 01:32:31,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 01:32:31,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 01:32:31,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 01:32:31,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 01:32:31,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 01:32:31,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 01:32:31,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 01:32:31,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 01:32:31,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 01:32:31,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 01:32:31,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 01:32:31,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 01:32:31,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 01:32:31,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 01:32:31,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 01:32:31,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 01:32:31,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 01:32:31,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 01:32:31,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 01:32:31,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 01:32:31,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 01:32:31,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 01:32:31,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 01:32:31,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 01:32:31,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 01:32:31,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 01:32:31,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 01:32:31,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 01:32:31,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 01:32:31,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 01:32:31,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 01:32:31,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 01:32:31,388 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-SP.epf [2020-10-22 01:32:31,424 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 01:32:31,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 01:32:31,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 01:32:31,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 01:32:31,426 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 01:32:31,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 01:32:31,427 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 01:32:31,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 01:32:31,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 01:32:31,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 01:32:31,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 01:32:31,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 01:32:31,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 01:32:31,428 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 01:32:31,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 01:32:31,429 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 01:32:31,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 01:32:31,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 01:32:31,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 01:32:31,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 01:32:31,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 01:32:31,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 01:32:31,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 01:32:31,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 01:32:31,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 01:32:31,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 01:32:31,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 01:32:31,431 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 01:32:31,431 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 01:32:31,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 01:32:31,431 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 01:32:31,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 01:32:31,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 01:32:31,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 01:32:31,741 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 01:32:31,743 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 01:32:31,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_pso.oepc.i [2020-10-22 01:32:31,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff72ac011/37fe21d9d66f41c68bc2a88c71a24f2b/FLAG77406507d [2020-10-22 01:32:32,375 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 01:32:32,376 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_pso.oepc.i [2020-10-22 01:32:32,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff72ac011/37fe21d9d66f41c68bc2a88c71a24f2b/FLAG77406507d [2020-10-22 01:32:32,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff72ac011/37fe21d9d66f41c68bc2a88c71a24f2b [2020-10-22 01:32:32,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 01:32:32,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 01:32:32,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 01:32:32,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 01:32:32,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 01:32:32,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:32:32" (1/1) ... [2020-10-22 01:32:32,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344dab00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:32, skipping insertion in model container [2020-10-22 01:32:32,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:32:32" (1/1) ... [2020-10-22 01:32:32,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 01:32:32,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 01:32:33,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:32:33,328 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 01:32:33,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:32:33,494 INFO L208 MainTranslator]: Completed translation [2020-10-22 01:32:33,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33 WrapperNode [2020-10-22 01:32:33,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 01:32:33,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 01:32:33,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 01:32:33,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 01:32:33,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 01:32:33,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 01:32:33,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 01:32:33,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 01:32:33,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (1/1) ... [2020-10-22 01:32:33,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 01:32:33,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 01:32:33,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 01:32:33,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 01:32:33,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (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-22 01:32:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 01:32:33,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 01:32:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 01:32:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 01:32:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 01:32:33,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 01:32:33,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 01:32:33,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 01:32:33,720 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 01:32:33,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 01:32:33,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 01:32:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 01:32:33,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 01:32:33,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 01:32:33,723 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 01:32:36,505 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 01:32:36,505 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 01:32:36,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:32:36 BoogieIcfgContainer [2020-10-22 01:32:36,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 01:32:36,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 01:32:36,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 01:32:36,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 01:32:36,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:32:32" (1/3) ... [2020-10-22 01:32:36,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b17817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:32:36, skipping insertion in model container [2020-10-22 01:32:36,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:32:33" (2/3) ... [2020-10-22 01:32:36,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b17817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:32:36, skipping insertion in model container [2020-10-22 01:32:36,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:32:36" (3/3) ... [2020-10-22 01:32:36,523 INFO L111 eAbstractionObserver]: Analyzing ICFG mix001_pso.oepc.i [2020-10-22 01:32:36,536 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 01:32:36,537 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 01:32:36,548 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 01:32:36,549 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 01:32:36,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,606 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,610 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,611 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,622 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,623 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,623 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,628 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,628 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,652 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,661 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,663 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,664 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,667 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,668 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,671 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,678 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:32:36,684 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 01:32:36,698 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 01:32:36,720 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 01:32:36,720 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 01:32:36,720 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 01:32:36,721 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 01:32:36,721 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 01:32:36,721 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 01:32:36,721 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 01:32:36,721 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 01:32:36,741 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 01:32:36,741 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 109 transitions, 233 flow [2020-10-22 01:32:36,745 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 109 transitions, 233 flow [2020-10-22 01:32:36,747 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 233 flow [2020-10-22 01:32:36,824 INFO L129 PetriNetUnfolder]: 3/106 cut-off events. [2020-10-22 01:32:36,825 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 01:32:36,833 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 3/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2020-10-22 01:32:36,840 INFO L116 LiptonReduction]: Number of co-enabled transitions 2174 [2020-10-22 01:32:37,337 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 01:32:38,760 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-22 01:32:38,871 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-22 01:32:40,147 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-22 01:32:40,335 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-22 01:32:40,345 INFO L131 LiptonReduction]: Checked pairs total: 7582 [2020-10-22 01:32:40,345 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-10-22 01:32:40,352 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-22 01:32:40,456 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1360 states. [2020-10-22 01:32:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states. [2020-10-22 01:32:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 01:32:40,487 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:40,490 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 01:32:40,490 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1439603, now seen corresponding path program 1 times [2020-10-22 01:32:40,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:40,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866962707] [2020-10-22 01:32:40,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:40,749 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-22 01:32:40,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866962707] [2020-10-22 01:32:40,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:40,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:32:40,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1335242182] [2020-10-22 01:32:40,753 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:40,756 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:40,768 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 01:32:40,768 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:40,772 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:32:40,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:32:40,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:32:40,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:32:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:32:40,787 INFO L87 Difference]: Start difference. First operand 1360 states. Second operand 3 states. [2020-10-22 01:32:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:32:40,915 INFO L93 Difference]: Finished difference Result 1166 states and 3780 transitions. [2020-10-22 01:32:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:32:40,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 01:32:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:32:40,950 INFO L225 Difference]: With dead ends: 1166 [2020-10-22 01:32:40,950 INFO L226 Difference]: Without dead ends: 950 [2020-10-22 01:32:40,952 INFO L677 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-22 01:32:40,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2020-10-22 01:32:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2020-10-22 01:32:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2020-10-22 01:32:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3024 transitions. [2020-10-22 01:32:41,087 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3024 transitions. Word has length 3 [2020-10-22 01:32:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:32:41,088 INFO L481 AbstractCegarLoop]: Abstraction has 950 states and 3024 transitions. [2020-10-22 01:32:41,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:32:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3024 transitions. [2020-10-22 01:32:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 01:32:41,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:41,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:32:41,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 01:32:41,090 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:41,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash -509725827, now seen corresponding path program 1 times [2020-10-22 01:32:41,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:41,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152908364] [2020-10-22 01:32:41,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:41,222 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-22 01:32:41,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152908364] [2020-10-22 01:32:41,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:41,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:32:41,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [246485713] [2020-10-22 01:32:41,223 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:41,224 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:41,226 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 01:32:41,226 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:41,226 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:32:41,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:32:41,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:32:41,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:32:41,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:32:41,229 INFO L87 Difference]: Start difference. First operand 950 states and 3024 transitions. Second operand 3 states. [2020-10-22 01:32:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:32:41,249 INFO L93 Difference]: Finished difference Result 878 states and 2760 transitions. [2020-10-22 01:32:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:32:41,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 01:32:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:32:41,257 INFO L225 Difference]: With dead ends: 878 [2020-10-22 01:32:41,258 INFO L226 Difference]: Without dead ends: 878 [2020-10-22 01:32:41,259 INFO L677 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-22 01:32:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2020-10-22 01:32:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2020-10-22 01:32:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2020-10-22 01:32:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 2760 transitions. [2020-10-22 01:32:41,295 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 2760 transitions. Word has length 9 [2020-10-22 01:32:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:32:41,296 INFO L481 AbstractCegarLoop]: Abstraction has 878 states and 2760 transitions. [2020-10-22 01:32:41,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:32:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 2760 transitions. [2020-10-22 01:32:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 01:32:41,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:41,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:32:41,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 01:32:41,299 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:41,300 INFO L82 PathProgramCache]: Analyzing trace with hash -220254406, now seen corresponding path program 1 times [2020-10-22 01:32:41,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:41,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124649137] [2020-10-22 01:32:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:41,408 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-22 01:32:41,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124649137] [2020-10-22 01:32:41,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:41,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:32:41,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621820975] [2020-10-22 01:32:41,409 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:41,412 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:41,416 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 01:32:41,416 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:41,416 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:32:41,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:32:41,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:32:41,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:32:41,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:32:41,417 INFO L87 Difference]: Start difference. First operand 878 states and 2760 transitions. Second operand 3 states. [2020-10-22 01:32:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:32:41,431 INFO L93 Difference]: Finished difference Result 830 states and 2588 transitions. [2020-10-22 01:32:41,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:32:41,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 01:32:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:32:41,438 INFO L225 Difference]: With dead ends: 830 [2020-10-22 01:32:41,438 INFO L226 Difference]: Without dead ends: 830 [2020-10-22 01:32:41,438 INFO L677 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-22 01:32:41,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2020-10-22 01:32:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2020-10-22 01:32:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2020-10-22 01:32:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2588 transitions. [2020-10-22 01:32:41,469 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2588 transitions. Word has length 11 [2020-10-22 01:32:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:32:41,469 INFO L481 AbstractCegarLoop]: Abstraction has 830 states and 2588 transitions. [2020-10-22 01:32:41,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:32:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2588 transitions. [2020-10-22 01:32:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 01:32:41,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:41,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:32:41,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 01:32:41,473 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:41,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1241092602, now seen corresponding path program 1 times [2020-10-22 01:32:41,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:41,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193441391] [2020-10-22 01:32:41,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:41,578 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-22 01:32:41,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193441391] [2020-10-22 01:32:41,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:41,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:32:41,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [767072258] [2020-10-22 01:32:41,579 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:41,583 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:41,590 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-22 01:32:41,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:42,091 WARN L193 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 01:32:42,187 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:32:42,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:32:42,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:32:42,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:32:42,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:32:42,189 INFO L87 Difference]: Start difference. First operand 830 states and 2588 transitions. Second operand 3 states. [2020-10-22 01:32:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:32:42,205 INFO L93 Difference]: Finished difference Result 798 states and 2476 transitions. [2020-10-22 01:32:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:32:42,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-22 01:32:42,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:32:42,212 INFO L225 Difference]: With dead ends: 798 [2020-10-22 01:32:42,213 INFO L226 Difference]: Without dead ends: 798 [2020-10-22 01:32:42,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-22 01:32:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2020-10-22 01:32:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2020-10-22 01:32:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-10-22 01:32:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2476 transitions. [2020-10-22 01:32:42,243 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2476 transitions. Word has length 13 [2020-10-22 01:32:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:32:42,244 INFO L481 AbstractCegarLoop]: Abstraction has 798 states and 2476 transitions. [2020-10-22 01:32:42,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:32:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2476 transitions. [2020-10-22 01:32:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 01:32:42,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:42,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:32:42,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 01:32:42,247 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash -865183306, now seen corresponding path program 1 times [2020-10-22 01:32:42,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:42,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008656443] [2020-10-22 01:32:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:42,483 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-22 01:32:42,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008656443] [2020-10-22 01:32:42,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:42,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:32:42,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183504931] [2020-10-22 01:32:42,485 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:42,494 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:42,526 INFO L252 McrAutomatonBuilder]: Finished intersection with 56 states and 111 transitions. [2020-10-22 01:32:42,526 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:42,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:32:42,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:32:42,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:32:43,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:32:43,110 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13440#(not (= 3 ~__unbuffered_cnt~0)), 13439#(= (mod ~main$tmp_guard0~0 256) 0)] [2020-10-22 01:32:43,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 01:32:43,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:32:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 01:32:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 01:32:43,112 INFO L87 Difference]: Start difference. First operand 798 states and 2476 transitions. Second operand 6 states. [2020-10-22 01:32:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:32:43,177 INFO L93 Difference]: Finished difference Result 560 states and 1577 transitions. [2020-10-22 01:32:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:32:43,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 01:32:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:32:43,181 INFO L225 Difference]: With dead ends: 560 [2020-10-22 01:32:43,181 INFO L226 Difference]: Without dead ends: 344 [2020-10-22 01:32:43,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:32:43,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-10-22 01:32:43,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2020-10-22 01:32:43,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-10-22 01:32:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 837 transitions. [2020-10-22 01:32:43,191 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 837 transitions. Word has length 15 [2020-10-22 01:32:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:32:43,191 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 837 transitions. [2020-10-22 01:32:43,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 01:32:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 837 transitions. [2020-10-22 01:32:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 01:32:43,193 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:43,193 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] [2020-10-22 01:32:43,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 01:32:43,193 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash 906231837, now seen corresponding path program 1 times [2020-10-22 01:32:43,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:43,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085956525] [2020-10-22 01:32:43,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:32:43,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085956525] [2020-10-22 01:32:43,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:43,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:32:43,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327567970] [2020-10-22 01:32:43,339 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:43,345 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:43,366 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 53 transitions. [2020-10-22 01:32:43,366 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:43,633 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:32:43,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 01:32:43,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:32:43,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 01:32:43,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 01:32:43,634 INFO L87 Difference]: Start difference. First operand 344 states and 837 transitions. Second operand 6 states. [2020-10-22 01:32:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:32:43,710 INFO L93 Difference]: Finished difference Result 321 states and 789 transitions. [2020-10-22 01:32:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 01:32:43,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-22 01:32:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:32:43,713 INFO L225 Difference]: With dead ends: 321 [2020-10-22 01:32:43,713 INFO L226 Difference]: Without dead ends: 305 [2020-10-22 01:32:43,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-22 01:32:43,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-10-22 01:32:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-10-22 01:32:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-10-22 01:32:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 759 transitions. [2020-10-22 01:32:43,722 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 759 transitions. Word has length 21 [2020-10-22 01:32:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:32:43,723 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 759 transitions. [2020-10-22 01:32:43,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 01:32:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 759 transitions. [2020-10-22 01:32:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:32:43,725 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:43,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:32:43,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 01:32:43,725 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:43,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:43,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1103763994, now seen corresponding path program 1 times [2020-10-22 01:32:43,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:43,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016921525] [2020-10-22 01:32:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:43,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-22 01:32:43,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016921525] [2020-10-22 01:32:43,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:43,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:32:43,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [728110181] [2020-10-22 01:32:43,850 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:43,858 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:43,883 INFO L252 McrAutomatonBuilder]: Finished intersection with 49 states and 72 transitions. [2020-10-22 01:32:43,883 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:44,355 WARN L193 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:32:44,862 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:32:45,357 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:32:45,643 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:32:45,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:32:45,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:32:45,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:32:45,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:32:45,644 INFO L87 Difference]: Start difference. First operand 305 states and 759 transitions. Second operand 4 states. [2020-10-22 01:32:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:32:45,665 INFO L93 Difference]: Finished difference Result 427 states and 1042 transitions. [2020-10-22 01:32:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:32:45,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-22 01:32:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:32:45,667 INFO L225 Difference]: With dead ends: 427 [2020-10-22 01:32:45,667 INFO L226 Difference]: Without dead ends: 185 [2020-10-22 01:32:45,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-22 01:32:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2020-10-22 01:32:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2020-10-22 01:32:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-22 01:32:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 414 transitions. [2020-10-22 01:32:45,674 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 414 transitions. Word has length 24 [2020-10-22 01:32:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:32:45,675 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 414 transitions. [2020-10-22 01:32:45,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:32:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 414 transitions. [2020-10-22 01:32:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:32:45,676 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:45,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:32:45,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 01:32:45,676 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:45,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:45,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1184544154, now seen corresponding path program 2 times [2020-10-22 01:32:45,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:45,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446150787] [2020-10-22 01:32:45,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:45,783 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-22 01:32:45,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446150787] [2020-10-22 01:32:45,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:45,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:32:45,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [424954551] [2020-10-22 01:32:45,784 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:45,791 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:45,818 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 63 transitions. [2020-10-22 01:32:45,818 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:46,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:32:46,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:32:46,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:32:46,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:32:46,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:32:46,270 INFO L87 Difference]: Start difference. First operand 185 states and 414 transitions. Second operand 4 states. [2020-10-22 01:32:46,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:32:46,302 INFO L93 Difference]: Finished difference Result 232 states and 512 transitions. [2020-10-22 01:32:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:32:46,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-22 01:32:46,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:32:46,303 INFO L225 Difference]: With dead ends: 232 [2020-10-22 01:32:46,304 INFO L226 Difference]: Without dead ends: 125 [2020-10-22 01:32:46,304 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-22 01:32:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-22 01:32:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-22 01:32:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-22 01:32:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 264 transitions. [2020-10-22 01:32:46,308 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 264 transitions. Word has length 24 [2020-10-22 01:32:46,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:32:46,308 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 264 transitions. [2020-10-22 01:32:46,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:32:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 264 transitions. [2020-10-22 01:32:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:32:46,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:32:46,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:32:46,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 01:32:46,310 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:32:46,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:32:46,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2118843440, now seen corresponding path program 3 times [2020-10-22 01:32:46,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:32:46,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915003883] [2020-10-22 01:32:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:32:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:32:46,714 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 37 [2020-10-22 01:32:47,049 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-22 01:32:47,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915003883] [2020-10-22 01:32:47,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:32:47,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 01:32:47,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248161934] [2020-10-22 01:32:47,051 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:32:47,056 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:32:47,094 INFO L252 McrAutomatonBuilder]: Finished intersection with 90 states and 170 transitions. [2020-10-22 01:32:47,094 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:32:47,584 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 134 [2020-10-22 01:32:47,604 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 3, 3, 2, 1] term [2020-10-22 01:32:47,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:47,605 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term [2020-10-22 01:32:47,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:47,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:32:47,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:47,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:47,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:47,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-22 01:32:47,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:48,051 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 32 [2020-10-22 01:32:48,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 2, 2, 1] term [2020-10-22 01:32:48,390 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:48,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term [2020-10-22 01:32:48,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:48,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:48,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:48,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:48,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:48,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-22 01:32:48,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:48,690 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2020-10-22 01:32:48,836 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 102 [2020-10-22 01:32:48,850 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 3, 2, 2, 1] term [2020-10-22 01:32:48,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:48,851 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 3, 1] term [2020-10-22 01:32:48,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:48,853 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:48,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:48,854 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:48,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:48,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-22 01:32:48,856 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:49,591 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 3, 3, 1] term [2020-10-22 01:32:49,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:49,592 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 3, 1] term [2020-10-22 01:32:49,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:49,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:32:49,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:49,603 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 3, 4, 3, 3, 1] term [2020-10-22 01:32:49,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:49,605 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 4, 3, 3, 1] term [2020-10-22 01:32:49,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,350 WARN L193 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 60 [2020-10-22 01:32:50,610 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 118 [2020-10-22 01:32:50,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 3, 3, 1] term [2020-10-22 01:32:50,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 3, 3, 1] term [2020-10-22 01:32:50,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:32:50,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 4, 3, 4, 3, 3, 1] term [2020-10-22 01:32:50,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:50,627 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 4, 3, 3, 1] term [2020-10-22 01:32:50,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,947 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 102 [2020-10-22 01:32:50,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 5, 2, 2, 1] term [2020-10-22 01:32:50,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:50,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:50,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:50,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:50,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:50,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:51,252 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2020-10-22 01:32:51,405 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2020-10-22 01:32:51,420 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 5, 2, 2, 1] term [2020-10-22 01:32:51,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:51,422 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:51,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:51,430 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:51,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:51,432 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:51,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:51,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:51,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:51,655 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2020-10-22 01:32:51,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 5, 2, 2, 1] term [2020-10-22 01:32:51,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:51,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:51,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:51,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:51,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:51,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:51,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:51,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:51,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:51,900 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 44 [2020-10-22 01:32:52,076 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 45 [2020-10-22 01:32:52,219 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 101 [2020-10-22 01:32:52,230 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 5, 2, 2, 1] term [2020-10-22 01:32:52,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:52,231 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:52,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:52,235 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:32:52,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:52,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:52,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:52,239 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:52,239 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:52,443 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 36 [2020-10-22 01:32:52,633 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 131 [2020-10-22 01:32:52,650 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 5, 2, 2, 1] term [2020-10-22 01:32:52,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:52,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:52,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:52,653 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:32:52,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:52,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:52,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:52,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:52,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:52,910 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 44 [2020-10-22 01:32:53,089 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 101 [2020-10-22 01:32:53,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:53,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:53,096 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:53,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:53,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:32:53,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:53,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:53,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:53,105 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:53,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:53,687 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 146 [2020-10-22 01:32:53,704 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:53,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:53,705 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:53,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:53,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:32:53,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:53,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:53,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:53,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:53,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:56,372 WARN L193 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 279 DAG size of output: 279 [2020-10-22 01:32:56,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,435 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 5, 3, 3, 1] term [2020-10-22 01:32:56,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,437 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 5, 2, 3, 1] term [2020-10-22 01:32:56,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,438 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,441 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 3, 3, 2, 1] term [2020-10-22 01:32:56,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:56,442 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-22 01:32:56,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:56,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-22 01:32:56,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:56,447 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 5, 4, 5, 4, 5, 3, 3, 1] term [2020-10-22 01:32:56,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,453 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,495 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,500 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 3, 1] term [2020-10-22 01:32:56,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,501 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 5, 3, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,502 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,504 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,505 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,506 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,515 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,517 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,524 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,532 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,533 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,542 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,547 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,548 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,553 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,557 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,558 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,566 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,567 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,572 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,578 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,580 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,584 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,587 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,593 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,594 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,601 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,602 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,607 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,609 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,621 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,622 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,630 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,635 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,637 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,647 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,651 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,652 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,657 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,661 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,662 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,668 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:32:56,669 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,674 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:32:56,680 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 7, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,682 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 7, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,684 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 7, 2, 5, 2, 3, 1] term [2020-10-22 01:32:56,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:56,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:56,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:56,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:56,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:56,758 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:56,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:56,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:56,984 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:32:56,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:57,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:57,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:57,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:57,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:57,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:32:58,081 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 116 [2020-10-22 01:32:58,084 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:58,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:58,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:58,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:58,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:58,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:58,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:58,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:58,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:58,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:58,580 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 144 [2020-10-22 01:32:58,586 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 5, 2, 2, 1] term [2020-10-22 01:32:58,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:58,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 1] term [2020-10-22 01:32:58,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:58,594 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:32:58,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:58,595 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:32:58,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:32:58,596 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 5, 3, 2, 1] term [2020-10-22 01:32:58,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:32:58,746 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2020-10-22 01:33:01,516 WARN L193 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 278 DAG size of output: 278 [2020-10-22 01:33:01,596 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,598 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 5, 3, 3, 1] term [2020-10-22 01:33:01,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,600 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 5, 2, 3, 1] term [2020-10-22 01:33:01,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,600 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,602 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,603 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,604 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,609 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 4, 3, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,614 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 3, 5, 2, 5, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,620 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:01,621 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,625 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,627 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,631 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,634 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:01,636 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,640 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,643 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:01,644 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,648 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,650 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,654 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:33:01,661 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 7, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 7, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 4, 7, 3, 7, 2, 7, 2, 5, 2, 3, 1] term [2020-10-22 01:33:01,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:01,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,901 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:33:01,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:01,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:02,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:02,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:02,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:02,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:02,223 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [16940#(and (or (not (= ~__unbuffered_p2_EBX~0 0)) (<= ~__unbuffered_p0_EAX~0 0)) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), 16941#(and (or (not (= ~__unbuffered_p2_EBX~0 0)) (<= ~__unbuffered_p0_EAX~0 0)) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 16942#(and (or (and (not (= ~z~0 0)) (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256)))) (<= ~__unbuffered_p0_EAX~0 0)) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 16943#(and (or (and (or (and (not (= ~z~0 0)) (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256)))) (<= ~__unbuffered_p0_EAX~0 0)) (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0) (<= ~__unbuffered_p0_EAX~0 0)) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0)))) (or (= (mod ~z$w_buff0_used~0 256) 0) (and (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1) (or (not (= ~z$w_buff0~0 0)) (<= ~__unbuffered_p0_EAX~0 0))))), 16944#(and (or (= (mod ~z$w_buff0_used~0 256) 0) (and (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (or (not (= ~z$w_buff0~0 0)) (<= ~__unbuffered_p0_EAX~0 0)))) (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (and (not (= ~z~0 0)) (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256)))) (<= ~__unbuffered_p0_EAX~0 0)) (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0) (<= ~__unbuffered_p0_EAX~0 0)) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)))), 16945#(and (or (= (mod ~z$r_buff0_thd1~0 256) 0) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~z$r_buff1_thd1~0 256) 0)) (<= ~__unbuffered_p0_EAX~0 0)) (or (= (mod ~z$w_buff0_used~0 256) 0) (and (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (or (not (= ~z$w_buff0~0 0)) (<= ~__unbuffered_p0_EAX~0 0)))))) (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0))) (and (or (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff1_thd1~0 256) 0) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (<= ~__unbuffered_p0_EAX~0 0)) (or (= (mod ~z$w_buff0_used~0 256) 0) (and (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (or (not (= ~z$w_buff0~0 0)) (<= ~__unbuffered_p0_EAX~0 0)))) (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (and (not (= ~z~0 0)) (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256)))) (<= ~__unbuffered_p0_EAX~0 0)) (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0) (<= ~__unbuffered_p0_EAX~0 0)) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)))))), 16946#(and (or (and (or (<= ~__unbuffered_p0_EAX~0 0) (and (= ~z$r_buff1_thd2~0 0) (not (= ~z~0 0)) (<= ~z$w_buff0_used~0 0) (= ~z$r_buff0_thd2~0 0) (<= 0 ~z$w_buff0_used~0))) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))) (or (= (mod ~z$w_buff0_used~0 256) 0) (and (or (<= ~__unbuffered_p0_EAX~0 0) (and (= ~z$r_buff1_thd2~0 0) (not (= ~z$w_buff0~0 0)) (= ~z$r_buff0_thd2~0 0))) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0))) (or (= (mod ~z$w_buff1_used~0 256) 0) (not (= (mod ~z$w_buff0_used~0 256) 0)) (= (mod ~z$r_buff1_thd1~0 256) 0) (<= ~__unbuffered_p0_EAX~0 0)))] [2020-10-22 01:33:02,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-22 01:33:02,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:33:02,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-22 01:33:02,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2020-10-22 01:33:02,224 INFO L87 Difference]: Start difference. First operand 125 states and 264 transitions. Second operand 19 states. [2020-10-22 01:33:02,366 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-10-22 01:33:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:33:03,606 INFO L93 Difference]: Finished difference Result 155 states and 314 transitions. [2020-10-22 01:33:03,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-22 01:33:03,607 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2020-10-22 01:33:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:33:03,608 INFO L225 Difference]: With dead ends: 155 [2020-10-22 01:33:03,608 INFO L226 Difference]: Without dead ends: 83 [2020-10-22 01:33:03,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 14 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2020-10-22 01:33:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-22 01:33:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-10-22 01:33:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-22 01:33:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 148 transitions. [2020-10-22 01:33:03,613 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 148 transitions. Word has length 24 [2020-10-22 01:33:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:33:03,613 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 148 transitions. [2020-10-22 01:33:03,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-22 01:33:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 148 transitions. [2020-10-22 01:33:03,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:33:03,614 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:33:03,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:33:03,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 01:33:03,615 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:33:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:33:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash 15229884, now seen corresponding path program 4 times [2020-10-22 01:33:03,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:33:03,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952691484] [2020-10-22 01:33:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:33:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:33:04,083 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2020-10-22 01:33:04,207 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-10-22 01:33:04,355 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-22 01:33:04,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952691484] [2020-10-22 01:33:04,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:33:04,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 01:33:04,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82280671] [2020-10-22 01:33:04,357 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:33:04,363 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:33:04,400 INFO L252 McrAutomatonBuilder]: Finished intersection with 68 states and 114 transitions. [2020-10-22 01:33:04,400 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:33:04,860 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2020-10-22 01:33:04,869 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-10-22 01:33:04,870 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:04,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:04,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:04,878 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:33:04,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:04,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 4, 3, 2, 2, 3, 2, 1] term [2020-10-22 01:33:04,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:33:04,881 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:33:04,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:05,109 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 28 [2020-10-22 01:33:05,386 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 28 [2020-10-22 01:33:05,792 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 35 [2020-10-22 01:33:05,953 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 39 [2020-10-22 01:33:06,098 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-10-22 01:33:06,225 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-10-22 01:33:06,432 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2020-10-22 01:33:06,535 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2020-10-22 01:33:06,567 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:33:06,567 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 2, 2, 1] term [2020-10-22 01:33:06,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:06,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-22 01:33:06,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:06,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:33:06,571 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-10-22 01:33:06,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:06,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:33:06,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:06,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 4, 6, 3, 5, 2, 5, 1] term [2020-10-22 01:33:06,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:33:06,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:33:06,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:07,463 WARN L193 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2020-10-22 01:33:07,836 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 110 [2020-10-22 01:33:07,845 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 3 conjuncts [2020-10-22 01:33:07,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:07,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:07,849 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:33:07,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:07,850 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 3, 3, 3, 2, 3, 1] term [2020-10-22 01:33:07,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:33:07,852 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:33:07,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:08,128 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 35 [2020-10-22 01:33:08,435 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 154 [2020-10-22 01:33:08,447 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 2, 2, 1] term [2020-10-22 01:33:08,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:08,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 2, 2, 1] term [2020-10-22 01:33:08,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:08,449 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:33:08,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:08,449 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 5, 3, 3, 2, 2, 1] term [2020-10-22 01:33:08,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:33:08,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[7, 8, 4, 2, 3, 2, 1] term [2020-10-22 01:33:08,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:08,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 8, 2, 8, 1] term [2020-10-22 01:33:08,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:33:08,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 8, 2, 8, 1] term [2020-10-22 01:33:08,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:33:08,773 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 39 [2020-10-22 01:33:10,828 WARN L193 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 262 DAG size of output: 251 [2020-10-22 01:33:10,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 9, 1] term [2020-10-22 01:33:10,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 9, 3, 2, 1] term [2020-10-22 01:33:10,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 9, 1] term [2020-10-22 01:33:10,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,877 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 9, 1] term [2020-10-22 01:33:10,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 3, 9, 3, 9, 3, 8, 1] term [2020-10-22 01:33:10,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,880 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 9, 3, 9, 3, 8, 1] term [2020-10-22 01:33:10,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,880 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 3, 9, 3, 9, 3, 8, 1] term [2020-10-22 01:33:10,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,882 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,883 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,884 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,886 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,887 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,888 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,892 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:10,893 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 01:33:10,895 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:33:10,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,901 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:10,903 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:33:10,905 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:33:10,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,912 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:10,918 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 01:33:10,923 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:33:10,929 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,931 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:10,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:10,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:10,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:10,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:10,963 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:33:10,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:10,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,542 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:11,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:13,855 WARN L193 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 280 DAG size of output: 280 [2020-10-22 01:33:13,896 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 9, 1] term [2020-10-22 01:33:13,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 9, 3, 2, 1] term [2020-10-22 01:33:13,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 9, 1] term [2020-10-22 01:33:13,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 9, 1] term [2020-10-22 01:33:13,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,902 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,903 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,904 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,904 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,907 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,907 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,908 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,909 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 2, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,910 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,910 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,911 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,915 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:13,916 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 01:33:13,918 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:33:13,921 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:33:13,923 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:33:13,928 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,930 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:13,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:13,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:13,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:13,946 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:33:13,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:13,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:13,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:13,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:14,512 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:33:14,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:14,514 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:14,515 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:33:14,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:14,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:14,517 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 2, 2, 1] term [2020-10-22 01:33:14,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:14,518 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 2, 1] term [2020-10-22 01:33:14,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:14,521 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 9, 3, 3, 3, 5, 2, 5, 1] term [2020-10-22 01:33:14,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:33:14,522 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 8, 3, 5, 1] term [2020-10-22 01:33:14,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:16,066 WARN L193 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 122 DAG size of output: 90 [2020-10-22 01:33:16,369 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 61 [2020-10-22 01:33:16,739 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 61 [2020-10-22 01:33:17,421 WARN L193 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 138 [2020-10-22 01:33:17,427 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:33:17,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:17,428 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:17,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:17,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:17,431 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 8, 2, 8, 2, 5, 1] term [2020-10-22 01:33:17,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:33:17,432 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 8, 3, 5, 1] term [2020-10-22 01:33:17,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,206 WARN L193 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 279 DAG size of output: 279 [2020-10-22 01:33:20,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 9, 1] term [2020-10-22 01:33:20,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 9, 3, 2, 1] term [2020-10-22 01:33:20,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 9, 1] term [2020-10-22 01:33:20,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,241 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 9, 1] term [2020-10-22 01:33:20,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,243 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,245 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,247 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,248 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,249 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,250 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 3, 4, 3, 4, 3, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,251 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,253 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,257 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:20,258 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:33:20,265 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 01:33:20,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,269 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:20,271 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:20,273 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:20,274 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:33:20,278 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 01:33:20,281 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:20,282 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:33:20,284 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 01:33:20,287 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:33:20,287 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:33:20,290 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:33:20,292 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:33:20,294 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 01:33:20,306 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 4, 9, 3, 9, 3, 9, 3, 9, 1] term [2020-10-22 01:33:20,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:33:20,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,342 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:33:20,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:33:20,963 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [17288#(or (<= ~__unbuffered_p0_EAX~0 0) (and (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (and (<= ~z$w_buff1_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))) (and (not (= (mod ~z$r_buff1_thd1~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0)))) (or (and (not (= ~z~0 0)) (or (<= ~z$w_buff1_used~0 0) (= ~z~0 1)) (or (= ~z~0 1) (< 0 (+ ~z$w_buff1_used~0 1))) (or (= ~z~0 1) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1))) (or (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (= ~z~0 1)) (or (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (not (= ~z~0 0)) (<= ~z$w_buff1_used~0 0) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ ~z$w_buff1_used~0 1)))) (or (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (not (= ~z~0 0)) (<= ~z$w_buff1_used~0 0) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ ~z$w_buff1_used~0 1)))) (or (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff1_thd1~0 256) 0))) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd1~0 256) 0) (and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (not (= ~z$w_buff0~0 0)) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)))))), 17289#(or (<= ~__unbuffered_p0_EAX~0 0) (and (or (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd1~0 256) 0) (and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (not (= ~z$w_buff0~0 0)) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)))) (not (= (mod ~z$r_buff0_thd1~0 256) 0)))) (or (and (not (= (mod ~z$r_buff1_thd2~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0))) (and (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (and (<= ~z$w_buff1_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))) (and (not (= (mod ~z$r_buff1_thd1~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0)))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd1~0 256) 0) (and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (not (= ~z$w_buff0~0 0)) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)))) (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd1~0 256) 0))) (and (not (= ~z~0 0)) (or (and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0)) (= ~z~0 1))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd2~0 256) 0))) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1))) (or (< 0 (+ (div ~z$w_buff0_used~0 256) 1)) (and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= ~z$w_buff1_used~0 0) (or (not (= ~z~0 0)) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0)))) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ ~z$w_buff1_used~0 1)))) (or (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0)) (= ~z~0 1))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd2~0 256) 0)))) (or (and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0)) (= ~z~0 1))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd2~0 256) 0))) (< 0 (+ ~z$w_buff1_used~0 1))) (or (<= ~z$w_buff0_used~0 (* 256 (div ~z$w_buff0_used~0 256))) (and (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (<= ~z$w_buff1_used~0 0) (or (not (= ~z~0 0)) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0)))) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1)) (< 0 (+ ~z$w_buff1_used~0 1)))) (or (<= ~z$w_buff1_used~0 0) (and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0)) (= ~z~0 1))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd2~0 256) 0)))) (or (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff1_thd1~0 256) 0))))))) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0)))) (or (and (or (and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0)) (= ~z~0 1))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd2~0 256) 0))) (< 0 (+ (div ~z$r_buff0_thd3~0 256) 1))) (or (and (or (and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0)) (= ~z~0 1))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd2~0 256) 0))) (< 0 (+ ~z$w_buff1_used~0 1))) (or (<= ~z$w_buff1_used~0 0) (and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0)) (= ~z~0 1))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd2~0 256) 0)))) (or (= (mod ~z$w_buff1_used~0 256) 0) (= (mod ~z$r_buff1_thd1~0 256) 0))) (and (not (= (mod ~z$r_buff1_thd2~0 256) 0)) (not (= (mod ~z$w_buff1_used~0 256) 0)))) (or (<= ~z$r_buff0_thd3~0 (* 256 (div ~z$r_buff0_thd3~0 256))) (and (or (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd2~0 256) 0))) (and (or (= (mod ~z$r_buff1_thd2~0 256) 0) (= (mod ~z$w_buff1_used~0 256) 0)) (= ~z~0 1))) (or (= (mod ~z$w_buff0_used~0 256) 0) (= ~z$w_buff0~0 1) (= (mod ~z$r_buff0_thd2~0 256) 0)))) (or (= (mod ~z$w_buff0_used~0 256) 0) (not (= ~z$w_buff0~0 0)))) (= (mod ~z$r_buff0_thd2~0 256) 0))))] [2020-10-22 01:33:20,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 01:33:20,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:33:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 01:33:20,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-22 01:33:20,964 INFO L87 Difference]: Start difference. First operand 83 states and 148 transitions. Second operand 10 states. [2020-10-22 01:33:21,208 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-10-22 01:33:21,564 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2020-10-22 01:33:21,962 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-10-22 01:33:22,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:33:22,022 INFO L93 Difference]: Finished difference Result 91 states and 157 transitions. [2020-10-22 01:33:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 01:33:22,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-10-22 01:33:22,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:33:22,025 INFO L225 Difference]: With dead ends: 91 [2020-10-22 01:33:22,025 INFO L226 Difference]: Without dead ends: 73 [2020-10-22 01:33:22,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-10-22 01:33:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-22 01:33:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-10-22 01:33:22,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-10-22 01:33:22,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 128 transitions. [2020-10-22 01:33:22,028 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 128 transitions. Word has length 24 [2020-10-22 01:33:22,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:33:22,028 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 128 transitions. [2020-10-22 01:33:22,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 01:33:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 128 transitions. [2020-10-22 01:33:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:33:22,029 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:33:22,029 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:33:22,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 01:33:22,029 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:33:22,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:33:22,030 INFO L82 PathProgramCache]: Analyzing trace with hash -950263750, now seen corresponding path program 5 times [2020-10-22 01:33:22,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:33:22,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634366896] [2020-10-22 01:33:22,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:33:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:33:22,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:33:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:33:22,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:33:22,218 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 01:33:22,218 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 01:33:22,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 01:33:22,221 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 01:33:22,245 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1392] [1392] L4-->L880: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In507271061 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In507271061 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In507271061 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In507271061 256) 0))) (let ((.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse2 (or .cse7 .cse6)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~z$r_buff1_thd0~0_In507271061 ~z$r_buff1_thd0~0_Out507271061) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In507271061 0)) (= ~z$r_buff0_thd0~0_In507271061 ~z$r_buff0_thd0~0_Out507271061) (or (and .cse0 (= ~z$w_buff0~0_In507271061 ~z~0_Out507271061) .cse1) (and .cse2 (or (and .cse3 (= ~z$w_buff1~0_In507271061 ~z~0_Out507271061) .cse4) (and (= ~z~0_In507271061 ~z~0_Out507271061) .cse5)))) (or (and (= ~z$w_buff1_used~0_Out507271061 ~z$w_buff1_used~0_In507271061) .cse5) (and (= ~z$w_buff1_used~0_Out507271061 0) .cse3 .cse4)) (or (and .cse2 (= ~z$w_buff0_used~0_Out507271061 ~z$w_buff0_used~0_In507271061)) (and .cse0 (= ~z$w_buff0_used~0_Out507271061 0) .cse1))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In507271061, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In507271061, ~z$w_buff0_used~0=~z$w_buff0_used~0_In507271061, ~z$w_buff0~0=~z$w_buff0~0_In507271061, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In507271061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In507271061, ~z$w_buff1~0=~z$w_buff1~0_In507271061, ~z~0=~z~0_In507271061} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out507271061, ~z$w_buff0~0=~z$w_buff0~0_In507271061, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out507271061, ~z$w_buff1~0=~z$w_buff1~0_In507271061, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out507271061|, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out507271061|, ULTIMATE.start_main_#t~ite76=|ULTIMATE.start_main_#t~ite76_Out507271061|, ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out507271061|, ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out507271061|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out507271061, ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out507271061|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In507271061, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out507271061, ~z~0=~z~0_Out507271061} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite74, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite72, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite76] because there is no mapped edge [2020-10-22 01:33:22,259 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-22 01:33:22,259 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,259 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-22 01:33:22,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,260 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-22 01:33:22,260 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,261 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-22 01:33:22,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,261 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-22 01:33:22,261 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,261 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-22 01:33:22,262 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,262 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-22 01:33:22,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,263 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-22 01:33:22,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,263 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-22 01:33:22,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,263 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-22 01:33:22,263 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,264 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-22 01:33:22,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,264 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-22 01:33:22,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,264 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-22 01:33:22,264 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,265 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-22 01:33:22,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,265 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-22 01:33:22,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,266 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-22 01:33:22,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,266 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-22 01:33:22,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,266 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-22 01:33:22,266 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,271 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-22 01:33:22,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,272 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-22 01:33:22,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,272 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-22 01:33:22,272 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,274 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-22 01:33:22,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,275 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-22 01:33:22,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,275 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-22 01:33:22,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,276 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-22 01:33:22,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,276 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-22 01:33:22,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,276 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-22 01:33:22,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,277 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-22 01:33:22,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,277 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-22 01:33:22,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,277 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-22 01:33:22,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,278 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-22 01:33:22,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,278 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-22 01:33:22,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,278 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-22 01:33:22,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,279 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-22 01:33:22,279 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,279 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-22 01:33:22,279 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,279 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-22 01:33:22,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,280 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-22 01:33:22,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,280 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-22 01:33:22,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,280 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-22 01:33:22,280 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,281 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-22 01:33:22,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,281 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-22 01:33:22,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,281 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-22 01:33:22,281 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,282 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-22 01:33:22,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,282 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-22 01:33:22,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,282 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-22 01:33:22,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,282 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-22 01:33:22,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:33:22,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:33:22 BasicIcfg [2020-10-22 01:33:22,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 01:33:22,395 INFO L168 Benchmark]: Toolchain (without parser) took 49723.27 ms. Allocated memory was 137.9 MB in the beginning and 676.3 MB in the end (delta: 538.4 MB). Free memory was 98.9 MB in the beginning and 342.5 MB in the end (delta: -243.6 MB). Peak memory consumption was 294.9 MB. Max. memory is 7.1 GB. [2020-10-22 01:33:22,395 INFO L168 Benchmark]: CDTParser took 3.30 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 01:33:22,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.89 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 98.1 MB in the beginning and 149.9 MB in the end (delta: -51.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-10-22 01:33:22,397 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.25 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 146.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-22 01:33:22,397 INFO L168 Benchmark]: Boogie Preprocessor took 69.13 ms. Allocated memory is still 201.3 MB. Free memory was 146.4 MB in the beginning and 143.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 01:33:22,398 INFO L168 Benchmark]: RCFGBuilder took 2862.32 ms. Allocated memory was 201.3 MB in the beginning and 251.7 MB in the end (delta: 50.3 MB). Free memory was 143.6 MB in the beginning and 199.8 MB in the end (delta: -56.3 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. [2020-10-22 01:33:22,399 INFO L168 Benchmark]: TraceAbstraction took 45880.68 ms. Allocated memory was 251.7 MB in the beginning and 676.3 MB in the end (delta: 424.7 MB). Free memory was 199.8 MB in the beginning and 342.5 MB in the end (delta: -142.7 MB). Peak memory consumption was 282.0 MB. Max. memory is 7.1 GB. [2020-10-22 01:33:22,402 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.30 ms. Allocated memory is still 137.9 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.89 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 98.1 MB in the beginning and 149.9 MB in the end (delta: -51.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.25 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 146.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.13 ms. Allocated memory is still 201.3 MB. Free memory was 146.4 MB in the beginning and 143.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2862.32 ms. Allocated memory was 201.3 MB in the beginning and 251.7 MB in the end (delta: 50.3 MB). Free memory was 143.6 MB in the beginning and 199.8 MB in the end (delta: -56.3 MB). Peak memory consumption was 112.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45880.68 ms. Allocated memory was 251.7 MB in the beginning and 676.3 MB in the end (delta: 424.7 MB). Free memory was 199.8 MB in the beginning and 342.5 MB in the end (delta: -142.7 MB). Peak memory consumption was 282.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1166 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 116 PlacesBefore, 39 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 2174 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 7582 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p1_EAX = 0; [L718] 0 int __unbuffered_p1_EBX = 0; [L720] 0 int __unbuffered_p2_EAX = 0; [L722] 0 int __unbuffered_p2_EBX = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff1_thd0; [L738] 0 _Bool z$r_buff1_thd1; [L739] 0 _Bool z$r_buff1_thd2; [L740] 0 _Bool z$r_buff1_thd3; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t20; [L865] FCALL, FORK 0 pthread_create(&t20, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t21; [L867] FCALL, FORK 0 pthread_create(&t21, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t22; [L869] FCALL, FORK 0 pthread_create(&t22, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1 = z$w_buff0 [L753] 1 z$w_buff0 = 1 [L754] 1 z$w_buff1_used = z$w_buff0_used [L755] 1 z$w_buff0_used = (_Bool)1 [L19] COND TRUE 1 !expression [L18] COND FALSE 1 !(0) [L18] 1 __assert_fail ("0", "mix001_pso.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) [L757] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L758] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L759] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L760] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L761] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 z$flush_delayed = weak$$choice2 [L767] 1 z$mem_tmp = z [L768] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1 [L768] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L769] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L770] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L771] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used) [L771] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L772] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L772] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 1 weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1) [L773] EXPR 1 weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L774] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 __unbuffered_p0_EAX = z [L776] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L776] 1 z = z$flush_delayed ? z$mem_tmp : z [L777] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L806] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L806] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L806] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L807] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L807] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L808] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L808] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L809] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L809] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L810] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L813] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 2 return 0; [L820] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 3 z$flush_delayed = weak$$choice2 [L829] 3 z$mem_tmp = z [L830] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L830] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L830] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L830] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L831] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L831] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L831] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0 [L831] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L831] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L831] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L832] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L833] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L833] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L833] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L833] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L833] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L834] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L834] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L834] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L835] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L836] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L836] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L837] 3 __unbuffered_p2_EBX = z [L838] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L838] 3 z = z$flush_delayed ? z$mem_tmp : z [L839] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L783] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L784] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L784] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L785] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L785] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L786] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L786] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L787] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L787] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L842] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L842] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L842] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L842] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L843] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L843] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L845] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L846] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L846] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L849] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 3 return 0; [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix001_pso.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 45.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 279 SDtfs, 399 SDslu, 755 SDs, 0 SdLazy, 626 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 187 SyntacticMatches, 21 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1360occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 38912 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...