/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/mix010_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 01:36:48,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 01:36:48,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 01:36:48,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 01:36:48,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 01:36:48,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 01:36:48,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 01:36:48,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 01:36:48,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 01:36:48,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 01:36:48,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 01:36:48,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 01:36:48,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 01:36:48,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 01:36:48,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 01:36:48,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 01:36:48,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 01:36:48,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 01:36:48,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 01:36:48,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 01:36:48,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 01:36:48,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 01:36:48,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 01:36:48,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 01:36:48,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 01:36:48,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 01:36:48,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 01:36:48,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 01:36:48,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 01:36:48,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 01:36:48,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 01:36:48,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 01:36:48,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 01:36:48,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 01:36:48,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 01:36:48,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 01:36:48,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 01:36:48,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 01:36:48,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 01:36:48,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 01:36:48,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 01:36:48,629 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:36:48,653 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 01:36:48,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 01:36:48,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 01:36:48,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 01:36:48,655 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 01:36:48,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 01:36:48,655 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 01:36:48,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 01:36:48,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 01:36:48,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 01:36:48,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 01:36:48,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 01:36:48,657 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 01:36:48,657 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 01:36:48,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 01:36:48,657 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 01:36:48,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 01:36:48,658 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 01:36:48,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 01:36:48,658 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 01:36:48,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 01:36:48,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 01:36:48,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 01:36:48,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 01:36:48,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 01:36:48,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 01:36:48,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 01:36:48,660 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 01:36:48,660 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 01:36:48,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 01:36:48,660 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 01:36:48,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 01:36:48,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 01:36:48,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 01:36:48,985 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 01:36:48,985 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 01:36:48,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i [2020-10-22 01:36:49,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96facc46f/f9c529ee3cec4dbe8d3ff13d3c1ebc1c/FLAG7c784c41a [2020-10-22 01:36:49,599 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 01:36:49,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i [2020-10-22 01:36:49,618 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96facc46f/f9c529ee3cec4dbe8d3ff13d3c1ebc1c/FLAG7c784c41a [2020-10-22 01:36:49,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96facc46f/f9c529ee3cec4dbe8d3ff13d3c1ebc1c [2020-10-22 01:36:49,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 01:36:49,945 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 01:36:49,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 01:36:49,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 01:36:49,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 01:36:49,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:36:49" (1/1) ... [2020-10-22 01:36:49,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aedcfc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:49, skipping insertion in model container [2020-10-22 01:36:49,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:36:49" (1/1) ... [2020-10-22 01:36:49,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 01:36:50,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 01:36:50,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:36:50,733 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 01:36:50,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:36:50,873 INFO L208 MainTranslator]: Completed translation [2020-10-22 01:36:50,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50 WrapperNode [2020-10-22 01:36:50,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 01:36:50,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 01:36:50,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 01:36:50,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 01:36:50,885 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:36:50" (1/1) ... [2020-10-22 01:36:50,907 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:36:50" (1/1) ... [2020-10-22 01:36:50,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 01:36:50,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 01:36:50,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 01:36:50,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 01:36:50,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (1/1) ... [2020-10-22 01:36:50,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (1/1) ... [2020-10-22 01:36:50,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (1/1) ... [2020-10-22 01:36:50,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (1/1) ... [2020-10-22 01:36:50,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (1/1) ... [2020-10-22 01:36:50,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (1/1) ... [2020-10-22 01:36:50,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (1/1) ... [2020-10-22 01:36:50,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 01:36:50,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 01:36:50,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 01:36:50,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 01:36:50,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (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:36:51,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 01:36:51,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 01:36:51,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 01:36:51,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 01:36:51,097 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 01:36:51,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 01:36:51,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 01:36:51,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 01:36:51,099 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 01:36:51,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 01:36:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 01:36:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 01:36:51,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 01:36:51,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 01:36:51,104 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:36:53,423 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 01:36:53,423 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 01:36:53,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:36:53 BoogieIcfgContainer [2020-10-22 01:36:53,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 01:36:53,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 01:36:53,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 01:36:53,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 01:36:53,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:36:49" (1/3) ... [2020-10-22 01:36:53,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2097e198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:36:53, skipping insertion in model container [2020-10-22 01:36:53,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:36:50" (2/3) ... [2020-10-22 01:36:53,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2097e198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:36:53, skipping insertion in model container [2020-10-22 01:36:53,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:36:53" (3/3) ... [2020-10-22 01:36:53,436 INFO L111 eAbstractionObserver]: Analyzing ICFG mix010_tso.oepc.i [2020-10-22 01:36:53,448 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 01:36:53,449 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 01:36:53,457 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 01:36:53,458 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 01:36:53,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,495 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,498 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,501 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,501 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,516 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,519 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,525 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,528 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,528 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,528 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,529 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,530 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:36:53,531 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 01:36:53,546 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 01:36:53,568 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 01:36:53,568 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 01:36:53,568 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 01:36:53,569 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 01:36:53,569 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 01:36:53,569 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 01:36:53,569 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 01:36:53,569 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 01:36:53,584 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 01:36:53,585 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 109 transitions, 233 flow [2020-10-22 01:36:53,588 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 109 transitions, 233 flow [2020-10-22 01:36:53,590 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 233 flow [2020-10-22 01:36:53,641 INFO L129 PetriNetUnfolder]: 3/106 cut-off events. [2020-10-22 01:36:53,642 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 01:36:53,647 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 88 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:36:53,651 INFO L116 LiptonReduction]: Number of co-enabled transitions 2166 [2020-10-22 01:36:54,999 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 01:36:55,579 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-22 01:36:55,988 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-22 01:36:56,122 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-22 01:36:56,604 WARN L193 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-22 01:36:56,875 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-22 01:36:56,890 INFO L131 LiptonReduction]: Checked pairs total: 6670 [2020-10-22 01:36:56,891 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-10-22 01:36:56,900 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-10-22 01:36:57,059 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1382 states. [2020-10-22 01:36:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states. [2020-10-22 01:36:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 01:36:57,094 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:36:57,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 01:36:57,099 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:36:57,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:36:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1115067, now seen corresponding path program 1 times [2020-10-22 01:36:57,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:36:57,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980182380] [2020-10-22 01:36:57,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:36:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:36:57,488 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:36:57,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980182380] [2020-10-22 01:36:57,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:36:57,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:36:57,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553023035] [2020-10-22 01:36:57,493 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:36:57,497 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:36:57,512 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 01:36:57,512 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:36:57,517 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:36:57,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:36:57,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:36:57,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:36:57,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:36:57,543 INFO L87 Difference]: Start difference. First operand 1382 states. Second operand 3 states. [2020-10-22 01:36:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:36:57,644 INFO L93 Difference]: Finished difference Result 1152 states and 3742 transitions. [2020-10-22 01:36:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:36:57,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 01:36:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:36:57,675 INFO L225 Difference]: With dead ends: 1152 [2020-10-22 01:36:57,676 INFO L226 Difference]: Without dead ends: 972 [2020-10-22 01:36:57,677 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:36:57,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2020-10-22 01:36:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2020-10-22 01:36:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-10-22 01:36:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions. [2020-10-22 01:36:57,795 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 3 [2020-10-22 01:36:57,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:36:57,796 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions. [2020-10-22 01:36:57,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:36:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions. [2020-10-22 01:36:57,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 01:36:57,799 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:36:57,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:36:57,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 01:36:57,800 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:36:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:36:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1644220088, now seen corresponding path program 1 times [2020-10-22 01:36:57,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:36:57,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815668982] [2020-10-22 01:36:57,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:36:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:36:57,966 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:36:57,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815668982] [2020-10-22 01:36:57,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:36:57,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 01:36:57,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621984966] [2020-10-22 01:36:57,968 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:36:57,969 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:36:57,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 01:36:57,971 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:36:57,972 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:36:57,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:36:57,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:36:57,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:36:57,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:36:57,974 INFO L87 Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 4 states. [2020-10-22 01:36:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:36:58,012 INFO L93 Difference]: Finished difference Result 1032 states and 3186 transitions. [2020-10-22 01:36:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:36:58,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 01:36:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:36:58,020 INFO L225 Difference]: With dead ends: 1032 [2020-10-22 01:36:58,021 INFO L226 Difference]: Without dead ends: 852 [2020-10-22 01:36:58,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:36:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2020-10-22 01:36:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2020-10-22 01:36:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-10-22 01:36:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2682 transitions. [2020-10-22 01:36:58,055 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2682 transitions. Word has length 10 [2020-10-22 01:36:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:36:58,056 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2682 transitions. [2020-10-22 01:36:58,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:36:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2682 transitions. [2020-10-22 01:36:58,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 01:36:58,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:36:58,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:36:58,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 01:36:58,060 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:36:58,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:36:58,060 INFO L82 PathProgramCache]: Analyzing trace with hash 299735000, now seen corresponding path program 1 times [2020-10-22 01:36:58,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:36:58,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859825289] [2020-10-22 01:36:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:36:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:36:58,144 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:36:58,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859825289] [2020-10-22 01:36:58,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:36:58,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 01:36:58,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [952203718] [2020-10-22 01:36:58,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:36:58,148 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:36:58,151 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-10-22 01:36:58,151 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:36:58,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:36:58,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:36:58,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:36:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:36:58,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:36:58,270 INFO L87 Difference]: Start difference. First operand 852 states and 2682 transitions. Second operand 4 states. [2020-10-22 01:36:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:36:58,309 INFO L93 Difference]: Finished difference Result 892 states and 2724 transitions. [2020-10-22 01:36:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:36:58,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 01:36:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:36:58,315 INFO L225 Difference]: With dead ends: 892 [2020-10-22 01:36:58,316 INFO L226 Difference]: Without dead ends: 772 [2020-10-22 01:36:58,316 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:36:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-10-22 01:36:58,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2020-10-22 01:36:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-10-22 01:36:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2398 transitions. [2020-10-22 01:36:58,343 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2398 transitions. Word has length 12 [2020-10-22 01:36:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:36:58,344 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 2398 transitions. [2020-10-22 01:36:58,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:36:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2398 transitions. [2020-10-22 01:36:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 01:36:58,347 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:36:58,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:36:58,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 01:36:58,347 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:36:58,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:36:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash 281535481, now seen corresponding path program 1 times [2020-10-22 01:36:58,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:36:58,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978120887] [2020-10-22 01:36:58,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:36:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:36:58,420 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:36:58,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978120887] [2020-10-22 01:36:58,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:36:58,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:36:58,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [708406555] [2020-10-22 01:36:58,422 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:36:58,423 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:36:58,429 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-10-22 01:36:58,429 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:36:58,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:36:58,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:36:58,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:36:58,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:36:58,953 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:36:59,014 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11170#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 01:36:59,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 01:36:59,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:36:59,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 01:36:59,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:36:59,016 INFO L87 Difference]: Start difference. First operand 772 states and 2398 transitions. Second operand 5 states. [2020-10-22 01:36:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:36:59,084 INFO L93 Difference]: Finished difference Result 484 states and 1331 transitions. [2020-10-22 01:36:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:36:59,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 01:36:59,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:36:59,087 INFO L225 Difference]: With dead ends: 484 [2020-10-22 01:36:59,087 INFO L226 Difference]: Without dead ends: 304 [2020-10-22 01:36:59,088 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:36:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-10-22 01:36:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-10-22 01:36:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-22 01:36:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 722 transitions. [2020-10-22 01:36:59,097 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 722 transitions. Word has length 14 [2020-10-22 01:36:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:36:59,098 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 722 transitions. [2020-10-22 01:36:59,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 01:36:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 722 transitions. [2020-10-22 01:36:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 01:36:59,099 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:36:59,099 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] [2020-10-22 01:36:59,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 01:36:59,100 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:36:59,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:36:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash 381973595, now seen corresponding path program 1 times [2020-10-22 01:36:59,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:36:59,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728091287] [2020-10-22 01:36:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:36:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:36:59,306 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:36:59,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728091287] [2020-10-22 01:36:59,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:36:59,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:36:59,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [183359244] [2020-10-22 01:36:59,308 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:36:59,313 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:36:59,325 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 52 transitions. [2020-10-22 01:36:59,325 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:36:59,608 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12273#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 01:36:59,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 01:36:59,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:36:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 01:36:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:36:59,609 INFO L87 Difference]: Start difference. First operand 304 states and 722 transitions. Second operand 7 states. [2020-10-22 01:36:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:36:59,685 INFO L93 Difference]: Finished difference Result 271 states and 654 transitions. [2020-10-22 01:36:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:36:59,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-22 01:36:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:36:59,688 INFO L225 Difference]: With dead ends: 271 [2020-10-22 01:36:59,689 INFO L226 Difference]: Without dead ends: 256 [2020-10-22 01:36:59,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:36:59,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-22 01:36:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2020-10-22 01:36:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2020-10-22 01:36:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 626 transitions. [2020-10-22 01:36:59,696 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 626 transitions. Word has length 20 [2020-10-22 01:36:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:36:59,696 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 626 transitions. [2020-10-22 01:36:59,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 01:36:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 626 transitions. [2020-10-22 01:36:59,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:36:59,698 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:36:59,698 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:36:59,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 01:36:59,698 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:36:59,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:36:59,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1800568565, now seen corresponding path program 1 times [2020-10-22 01:36:59,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:36:59,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585572275] [2020-10-22 01:36:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:36:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:36:59,863 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:36:59,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585572275] [2020-10-22 01:36:59,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:36:59,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 01:36:59,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [291978402] [2020-10-22 01:36:59,865 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:36:59,872 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:36:59,904 INFO L252 McrAutomatonBuilder]: Finished intersection with 74 states and 134 transitions. [2020-10-22 01:36:59,904 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:37:00,455 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:37:01,290 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:37:01,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 01:37:01,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:37:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 01:37:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:37:01,291 INFO L87 Difference]: Start difference. First operand 256 states and 626 transitions. Second operand 5 states. [2020-10-22 01:37:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:37:01,325 INFO L93 Difference]: Finished difference Result 379 states and 910 transitions. [2020-10-22 01:37:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:37:01,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-22 01:37:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:37:01,327 INFO L225 Difference]: With dead ends: 379 [2020-10-22 01:37:01,327 INFO L226 Difference]: Without dead ends: 176 [2020-10-22 01:37:01,327 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:37:01,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-22 01:37:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-22 01:37:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-22 01:37:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 396 transitions. [2020-10-22 01:37:01,334 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 396 transitions. Word has length 24 [2020-10-22 01:37:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:37:01,334 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 396 transitions. [2020-10-22 01:37:01,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 01:37:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 396 transitions. [2020-10-22 01:37:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:37:01,335 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:37:01,335 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:37:01,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 01:37:01,336 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:37:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:37:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash 62124235, now seen corresponding path program 2 times [2020-10-22 01:37:01,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:37:01,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650110596] [2020-10-22 01:37:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:37:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:37:01,525 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:37:01,526 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650110596] [2020-10-22 01:37:01,526 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:37:01,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 01:37:01,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42946203] [2020-10-22 01:37:01,526 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:37:01,533 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:37:01,567 INFO L252 McrAutomatonBuilder]: Finished intersection with 71 states and 125 transitions. [2020-10-22 01:37:01,567 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:37:02,214 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 4 [2020-10-22 01:37:02,750 WARN L193 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 4 [2020-10-22 01:37:03,184 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13808#(or (not (= (mod ~a$w_buff0_used~0 256) 0)) (= ~z~0 1)), 13807#(or (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= ~z~0 0)))] [2020-10-22 01:37:03,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 01:37:03,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:37:03,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 01:37:03,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-22 01:37:03,185 INFO L87 Difference]: Start difference. First operand 176 states and 396 transitions. Second operand 9 states. [2020-10-22 01:37:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:37:03,483 INFO L93 Difference]: Finished difference Result 247 states and 548 transitions. [2020-10-22 01:37:03,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-22 01:37:03,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-22 01:37:03,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:37:03,485 INFO L225 Difference]: With dead ends: 247 [2020-10-22 01:37:03,485 INFO L226 Difference]: Without dead ends: 129 [2020-10-22 01:37:03,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2020-10-22 01:37:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-22 01:37:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2020-10-22 01:37:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-22 01:37:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 256 transitions. [2020-10-22 01:37:03,493 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 256 transitions. Word has length 24 [2020-10-22 01:37:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:37:03,493 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 256 transitions. [2020-10-22 01:37:03,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 01:37:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 256 transitions. [2020-10-22 01:37:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:37:03,494 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:37:03,494 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:37:03,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 01:37:03,495 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:37:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:37:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2115896701, now seen corresponding path program 3 times [2020-10-22 01:37:03,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:37:03,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785544993] [2020-10-22 01:37:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:37:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:37:03,819 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:37:03,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785544993] [2020-10-22 01:37:03,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:37:03,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 01:37:03,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072428623] [2020-10-22 01:37:03,820 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:37:03,826 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:37:03,913 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 120 transitions. [2020-10-22 01:37:03,913 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:37:04,397 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:37:04,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:04,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:04,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,409 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:04,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,410 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:04,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,412 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:04,414 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,417 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:04,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,439 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:37:04,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,457 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,461 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:04,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,523 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:04,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,535 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:37:04,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,553 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:04,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,750 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 29 [2020-10-22 01:37:04,917 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2020-10-22 01:37:04,931 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:37:04,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,939 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:04,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:04,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,943 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-10-22 01:37:04,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,948 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:04,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,957 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:04,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:04,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:04,971 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:04,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:04,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:05,003 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,020 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:05,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:05,025 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:05,032 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:05,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,037 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,052 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:05,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,057 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,073 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:05,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,078 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:05,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:05,103 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:05,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,115 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:05,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,119 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,213 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:05,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:05,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 4, 3, 2, 3, 2, 1] term [2020-10-22 01:37:05,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:05,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,229 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:05,230 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:05,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,246 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:05,246 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:05,256 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,264 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:05,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,270 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:05,275 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,284 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,295 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:05,297 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:05,298 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:05,308 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,317 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:05,331 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:05,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:05,780 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 38 [2020-10-22 01:37:06,094 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 126 [2020-10-22 01:37:06,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,115 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:06,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,116 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:06,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,138 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:06,147 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:06,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,205 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:06,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:06,209 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:06,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,231 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-22 01:37:06,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,853 WARN L193 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2020-10-22 01:37:06,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:06,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 6, 3, 2, 1] term [2020-10-22 01:37:06,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:06,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:06,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,892 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:06,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,914 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:06,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:06,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:06,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:06,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,510 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 95 [2020-10-22 01:37:07,519 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:37:07,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,527 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:07,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,530 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:37:07,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:07,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:07,532 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 01:37:07,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,534 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:07,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:07,548 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:07,557 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:07,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:07,566 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:07,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:07,582 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:07,588 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:07,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:07,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:07,607 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 01:37:07,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:07,609 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:07,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:07,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:07,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:07,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,153 WARN L193 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 33 [2020-10-22 01:37:08,304 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2020-10-22 01:37:08,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:08,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 2, 7, 1] term [2020-10-22 01:37:08,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:08,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:08,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,321 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:08,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,337 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:08,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,364 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:08,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,552 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 96 [2020-10-22 01:37:08,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:08,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 2, 7, 1] term [2020-10-22 01:37:08,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:08,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:08,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,577 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:08,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,596 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:08,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:08,609 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:08,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:08,771 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 31 [2020-10-22 01:37:08,888 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 32 [2020-10-22 01:37:08,996 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 32 [2020-10-22 01:37:09,290 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2020-10-22 01:37:09,296 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:37:09,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,301 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:09,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:37:09,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,303 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:37:09,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,311 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:09,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,331 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 3 conjuncts [2020-10-22 01:37:09,332 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,333 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:09,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,340 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:09,346 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:09,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,358 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:09,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,371 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:09,376 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:09,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,389 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:09,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,638 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 125 [2020-10-22 01:37:09,650 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:37:09,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:09,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:37:09,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,659 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:37:09,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,682 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:09,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,692 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 3 conjuncts [2020-10-22 01:37:09,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,693 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:09,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,702 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:09,709 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,716 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:09,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,731 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 3 conjuncts [2020-10-22 01:37:09,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,733 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:09,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:09,749 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:09,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:09,830 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:09,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:09,846 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:09,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,140 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 96 [2020-10-22 01:37:10,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:10,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 2, 7, 1] term [2020-10-22 01:37:10,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:10,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,171 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:10,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,173 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:10,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,190 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:10,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,212 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:10,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,434 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 31 [2020-10-22 01:37:10,870 WARN L193 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 128 [2020-10-22 01:37:10,876 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:37:10,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:10,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,881 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:37:10,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:10,882 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 01:37:10,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,898 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:10,905 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 3 conjuncts [2020-10-22 01:37:10,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:10,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,906 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:10,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,912 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:10,917 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:10,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,926 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:10,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:10,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,938 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:10,939 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:10,944 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:10,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:10,953 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:10,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,121 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2020-10-22 01:37:11,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,135 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:11,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,136 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 2, 7, 1] term [2020-10-22 01:37:11,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:11,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:11,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,151 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:11,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,166 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:11,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:11,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,470 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 127 [2020-10-22 01:37:11,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,490 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:11,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 2, 7, 1] term [2020-10-22 01:37:11,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:11,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:11,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,510 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:11,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,525 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:11,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,531 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:11,537 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 01:37:11,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:11,602 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [14328#(or (not (= (mod ~a$w_buff0_used~0 256) 0)) (and (= ~a$w_buff0_used~0 0) (= ~a$r_buff0_thd2~0 0) (= ~__unbuffered_cnt~0 0) (= ~a$r_buff0_thd3~0 0))), 14329#(and (= ~__unbuffered_p2_EBX~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), 14330#(and (= ~__unbuffered_p2_EBX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0)), 14331#(and (= ~a$r_buff1_thd3~0 0) (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (and (= (mod ~a$w_buff1_used~0 256) 0) (= ~a~0 1))) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (= ~a$w_buff0~0 1) (= (mod ~a$w_buff0_used~0 256) 0)) (= ~__unbuffered_cnt~0 0) (= ~a$r_buff0_thd3~0 0)), 14332#(and (or (and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= (mod ~a$w_buff1_used~0 256) 0) (= ~__unbuffered_cnt~0 0) (= ~a$r_buff0_thd3~0 0)) (= (mod ~a$r_buff0_thd1~0 256) 0) (= (mod ~a$w_buff0_used~0 256) 0)) (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (and (= ~a$r_buff1_thd3~0 0) (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (and (= (mod ~a$w_buff1_used~0 256) 0) (= ~a~0 1))) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (= ~a$w_buff0~0 1) (= (mod ~a$w_buff0_used~0 256) 0)) (= ~__unbuffered_cnt~0 0) (= ~a$r_buff0_thd3~0 0)))), 14333#(and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd3~0 0) (or (= ~a$w_buff0~0 1) (= (mod ~a$w_buff0_used~0 256) 0)) (= ~a$r_buff0_thd2~0 0) (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (and (= ~a$w_buff0_used~0 0) (= ~a~0 1))) (= ~__unbuffered_cnt~0 0) (= ~a$r_buff0_thd3~0 0))] [2020-10-22 01:37:11,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-22 01:37:11,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:37:11,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-22 01:37:11,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2020-10-22 01:37:11,603 INFO L87 Difference]: Start difference. First operand 121 states and 256 transitions. Second operand 18 states. [2020-10-22 01:37:12,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:37:12,381 INFO L93 Difference]: Finished difference Result 178 states and 350 transitions. [2020-10-22 01:37:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-22 01:37:12,381 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2020-10-22 01:37:12,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:37:12,382 INFO L225 Difference]: With dead ends: 178 [2020-10-22 01:37:12,383 INFO L226 Difference]: Without dead ends: 130 [2020-10-22 01:37:12,383 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2020-10-22 01:37:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-10-22 01:37:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2020-10-22 01:37:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-22 01:37:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 229 transitions. [2020-10-22 01:37:12,386 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 229 transitions. Word has length 24 [2020-10-22 01:37:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:37:12,386 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 229 transitions. [2020-10-22 01:37:12,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-22 01:37:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 229 transitions. [2020-10-22 01:37:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:37:12,387 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:37:12,387 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:37:12,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 01:37:12,388 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:37:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:37:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash -201387611, now seen corresponding path program 4 times [2020-10-22 01:37:12,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:37:12,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649910940] [2020-10-22 01:37:12,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:37:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:37:12,635 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:37:12,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649910940] [2020-10-22 01:37:12,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:37:12,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 01:37:12,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [371339708] [2020-10-22 01:37:12,636 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:37:12,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:37:12,675 INFO L252 McrAutomatonBuilder]: Finished intersection with 86 states and 162 transitions. [2020-10-22 01:37:12,675 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:37:12,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:12,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:12,805 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:12,805 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:12,806 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:12,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:12,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:12,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:12,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:12,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:12,830 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:12,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:12,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:12,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:12,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:37:12,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,239 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:13,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:13,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,243 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:13,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,246 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:37:13,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,255 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:13,274 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:37:13,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,287 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,289 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,296 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:13,298 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,314 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:37:13,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,325 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:13,327 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,329 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:13,334 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,349 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:13,352 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,371 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:37:13,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,734 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 123 [2020-10-22 01:37:13,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,739 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,742 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:13,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,744 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:13,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:13,752 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:13,760 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:37:13,762 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:13,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:13,788 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:37:13,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,103 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:14,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,112 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:14,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,114 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:14,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,115 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:14,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:14,116 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:37:14,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,126 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,132 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:14,139 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:37:14,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,151 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:14,161 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:37:14,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,171 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:14,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:14,179 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:14,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,185 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:14,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:14,204 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:14,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,229 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:37:14,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,522 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:14,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,524 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:14,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,526 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:14,544 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:14,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:14,566 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:14,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:14,568 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:14,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:14,599 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:37:14,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:15,023 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2020-10-22 01:37:15,180 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 29 [2020-10-22 01:37:15,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:15,212 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:15,214 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:15,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:15,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:15,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:15,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 4, 4, 2, 3, 2, 1] term [2020-10-22 01:37:15,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:15,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:15,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:15,224 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:15,224 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:15,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,233 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:15,239 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:15,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,249 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:37:15,249 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:15,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,257 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:15,262 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:15,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:15,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,278 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:15,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,286 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:15,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:15,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,306 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:37:15,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:15,314 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:15,320 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:15,326 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-22 01:37:15,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:15,826 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 39 [2020-10-22 01:37:15,996 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2020-10-22 01:37:16,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,001 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:16,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:16,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:16,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,007 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:37:16,007 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:16,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:16,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:16,026 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:16,028 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:37:16,028 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:16,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:16,043 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:16,044 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,049 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:37:16,050 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:16,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,078 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 01:37:16,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,328 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 29 [2020-10-22 01:37:16,668 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 105 [2020-10-22 01:37:16,672 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:16,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,676 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:16,676 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,677 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-10-22 01:37:16,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:16,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,679 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,685 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:16,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:16,695 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:16,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,713 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:16,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,723 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:16,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,734 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:16,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:16,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,743 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:16,747 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:16,752 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:16,753 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:16,759 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 3, 3, 2, 1] term [2020-10-22 01:37:16,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,038 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2020-10-22 01:37:17,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,044 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:17,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:17,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 6, 2, 3, 2, 1] term [2020-10-22 01:37:17,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:17,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:17,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,050 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:37:17,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,055 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:17,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,057 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,062 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,073 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,085 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,099 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:17,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,109 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:17,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,328 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 29 [2020-10-22 01:37:17,513 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2020-10-22 01:37:17,526 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:17,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,530 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:17,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,532 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:37:17,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:17,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,537 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:17,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,545 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:17,554 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:37:17,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,554 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:17,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,559 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:17,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,578 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,588 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,599 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:17,599 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:17,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:17,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:17,800 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 29 [2020-10-22 01:37:17,967 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 29 [2020-10-22 01:37:18,595 WARN L193 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 123 [2020-10-22 01:37:18,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:18,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:18,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:18,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:18,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-22 01:37:18,611 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:18,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:18,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:18,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:18,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:18,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:18,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:18,631 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:18,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:18,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:18,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:18,647 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:18,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:18,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:18,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:18,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:18,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:18,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,091 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 94 [2020-10-22 01:37:19,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,106 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:19,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,107 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-22 01:37:19,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:19,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:19,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,108 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:19,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,129 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:19,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:19,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,413 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 94 [2020-10-22 01:37:19,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,423 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:19,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,424 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 5, 1] term [2020-10-22 01:37:19,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:19,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:19,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:19,426 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:19,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:19,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,447 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:19,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,461 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:19,469 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:19,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:19,627 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 29 [2020-10-22 01:37:19,735 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 29 [2020-10-22 01:37:20,330 WARN L193 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 126 [2020-10-22 01:37:20,338 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:20,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,342 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:20,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:37:20,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:20,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:20,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,344 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:37:20,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:20,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:20,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,346 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:20,349 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:37:20,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,354 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,369 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:37:20,370 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:20,373 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,380 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,386 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,405 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:20,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,406 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,417 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 2, 2, 3, 2, 1] term [2020-10-22 01:37:20,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:20,418 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:20,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,419 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:20,433 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:20,442 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:37:20,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,443 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,781 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 125 [2020-10-22 01:37:20,789 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:37:20,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,792 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:37:20,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,793 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:37:20,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:20,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,795 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:37:20,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,796 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:37:20,811 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 2 conjuncts [2020-10-22 01:37:20,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,811 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:20,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,821 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,825 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:37:20,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,830 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,839 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,845 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:37:20,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:37:20,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:20,856 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:37:20,857 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:37:21,027 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [14760#(and (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (= (mod ~a$w_buff1_used~0 256) 0)) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)) (= (mod ~a$w_buff0_used~0 256) 0)) (or (and (= ~a$r_buff1_thd3~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)) (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd2~0 256) 0))))), 14761#(and (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd2~0 256) 0))) (= (mod ~a$w_buff1_used~0 256) 0)) (or (= (mod ~a$r_buff0_thd2~0 256) 0) (and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd3~0 0)) (= (mod ~a$w_buff0_used~0 256) 0)) (or (and (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= (mod ~a$w_buff1_used~0 256) 0) (= ~a$r_buff0_thd3~0 0)) (= (mod ~a$r_buff0_thd1~0 256) 0) (= (mod ~a$w_buff0_used~0 256) 0)) (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (and (= ~a$r_buff1_thd3~0 0) (= ~a~0 1) (= ~a$r_buff0_thd3~0 0)) (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd2~0 256) 0))))), 14762#(and (or (= (mod ~a$r_buff0_thd1~0 256) 0) (and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a$w_buff0~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)) (= (mod ~a$w_buff0_used~0 256) 0)) (or (and (not (= (mod ~a$w_buff0_used~0 256) 0)) (not (= (mod ~a$r_buff0_thd1~0 256) 0))) (and (= ~a$w_buff1_used~0 0) (= ~a$r_buff1_thd3~0 0) (= ~a~0 1) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)))), 14763#(or (not (= (mod ~a$w_buff0_used~0 256) 0)) (and (= ~a$w_buff0_used~0 0) (= ~a$r_buff0_thd2~0 0) (= ~a$r_buff0_thd3~0 0)))] [2020-10-22 01:37:21,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 01:37:21,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:37:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 01:37:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-22 01:37:21,029 INFO L87 Difference]: Start difference. First operand 116 states and 229 transitions. Second operand 12 states. [2020-10-22 01:37:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:37:21,420 INFO L93 Difference]: Finished difference Result 128 states and 244 transitions. [2020-10-22 01:37:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:37:21,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2020-10-22 01:37:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:37:21,422 INFO L225 Difference]: With dead ends: 128 [2020-10-22 01:37:21,422 INFO L226 Difference]: Without dead ends: 69 [2020-10-22 01:37:21,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-10-22 01:37:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-22 01:37:21,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-10-22 01:37:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-22 01:37:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 120 transitions. [2020-10-22 01:37:21,425 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 120 transitions. Word has length 24 [2020-10-22 01:37:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:37:21,426 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 120 transitions. [2020-10-22 01:37:21,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 01:37:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 120 transitions. [2020-10-22 01:37:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 01:37:21,426 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:37:21,427 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:37:21,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 01:37:21,427 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:37:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:37:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash 639835703, now seen corresponding path program 5 times [2020-10-22 01:37:21,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:37:21,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517983923] [2020-10-22 01:37:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:37:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:37:21,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:37:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:37:21,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:37:21,652 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 01:37:21,653 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 01:37:21,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 01:37:21,687 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:37:21,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,687 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:37:21,688 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [750] [2020-10-22 01:37:21,691 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:37:21,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,691 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:37:21,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,691 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:37:21,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,692 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:37:21,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,692 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:37:21,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,694 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:37:21,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,695 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:37:21,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,695 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:37:21,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,695 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:37:21,695 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,696 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:37:21,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,696 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:37:21,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,696 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:37:21,696 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,697 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:37:21,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,697 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:37:21,697 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,701 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:37:21,701 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,702 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:37:21,702 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,702 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:37:21,702 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,702 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:37:21,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,703 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:37:21,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,703 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:37:21,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,703 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:37:21,703 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,703 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:37:21,704 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,704 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:37:21,704 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,704 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:37:21,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,705 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:37:21,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,705 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:37:21,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,705 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:37:21,705 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,706 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:37:21,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,706 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:37:21,706 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,707 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:37:21,707 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,708 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:37:21,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,708 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:37:21,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,708 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:37:21,708 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,708 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:37:21,709 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,709 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:37:21,709 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:37:21,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:37:21 BasicIcfg [2020-10-22 01:37:21,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 01:37:21,831 INFO L168 Benchmark]: Toolchain (without parser) took 31892.27 ms. Allocated memory was 136.8 MB in the beginning and 562.0 MB in the end (delta: 425.2 MB). Free memory was 98.0 MB in the beginning and 437.9 MB in the end (delta: -339.9 MB). Peak memory consumption was 85.3 MB. Max. memory is 7.1 GB. [2020-10-22 01:37:21,833 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 01:37:21,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 928.03 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 96.9 MB in the beginning and 148.9 MB in the end (delta: -52.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-22 01:37:21,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.91 ms. Allocated memory is still 199.8 MB. Free memory was 148.9 MB in the beginning and 146.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2020-10-22 01:37:21,836 INFO L168 Benchmark]: Boogie Preprocessor took 44.73 ms. Allocated memory is still 199.8 MB. Free memory was 146.7 MB in the beginning and 143.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-22 01:37:21,839 INFO L168 Benchmark]: RCFGBuilder took 2438.55 ms. Allocated memory was 199.8 MB in the beginning and 255.3 MB in the end (delta: 55.6 MB). Free memory was 143.9 MB in the beginning and 178.8 MB in the end (delta: -34.9 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. [2020-10-22 01:37:21,840 INFO L168 Benchmark]: TraceAbstraction took 28401.48 ms. Allocated memory was 255.3 MB in the beginning and 562.0 MB in the end (delta: 306.7 MB). Free memory was 178.8 MB in the beginning and 437.9 MB in the end (delta: -259.2 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. [2020-10-22 01:37:21,843 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 136.8 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 928.03 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 96.9 MB in the beginning and 148.9 MB in the end (delta: -52.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.91 ms. Allocated memory is still 199.8 MB. Free memory was 148.9 MB in the beginning and 146.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.73 ms. Allocated memory is still 199.8 MB. Free memory was 146.7 MB in the beginning and 143.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2438.55 ms. Allocated memory was 199.8 MB in the beginning and 255.3 MB in the end (delta: 55.6 MB). Free memory was 143.9 MB in the beginning and 178.8 MB in the end (delta: -34.9 MB). Peak memory consumption was 100.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28401.48 ms. Allocated memory was 255.3 MB in the beginning and 562.0 MB in the end (delta: 306.7 MB). Free memory was 178.8 MB in the beginning and 437.9 MB in the end (delta: -259.2 MB). Peak memory consumption was 47.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1182 VarBasedMoverChecksPositive, 38 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 110 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 116 PlacesBefore, 39 PlacesAfterwards, 109 TransitionsBefore, 30 TransitionsAfterwards, 2166 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 94 TotalNumberOfCompositions, 6670 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t275; [L851] FCALL, FORK 0 pthread_create(&t275, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t276; [L853] FCALL, FORK 0 pthread_create(&t276, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix010_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t277; [L855] FCALL, FORK 0 pthread_create(&t277, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L780] 2 x = 1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L806] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1 [L816] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L817] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L820] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L822] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1] [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L828] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L861] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix010_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.0s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 306 SDtfs, 413 SDslu, 1004 SDs, 0 SdLazy, 674 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 213 SyntacticMatches, 31 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 20883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...