/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 21:48:09,711 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 21:48:09,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 21:48:09,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 21:48:09,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 21:48:09,741 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 21:48:09,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 21:48:09,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 21:48:09,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 21:48:09,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 21:48:09,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 21:48:09,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 21:48:09,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 21:48:09,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 21:48:09,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 21:48:09,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 21:48:09,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 21:48:09,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 21:48:09,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 21:48:09,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 21:48:09,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 21:48:09,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 21:48:09,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 21:48:09,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 21:48:09,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 21:48:09,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 21:48:09,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 21:48:09,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 21:48:09,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 21:48:09,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 21:48:09,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 21:48:09,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 21:48:09,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 21:48:09,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 21:48:09,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 21:48:09,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 21:48:09,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 21:48:09,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 21:48:09,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 21:48:09,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 21:48:09,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 21:48:09,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-21 21:48:09,797 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 21:48:09,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 21:48:09,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 21:48:09,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 21:48:09,799 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 21:48:09,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 21:48:09,800 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 21:48:09,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 21:48:09,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 21:48:09,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 21:48:09,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 21:48:09,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 21:48:09,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 21:48:09,801 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 21:48:09,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 21:48:09,801 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 21:48:09,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 21:48:09,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 21:48:09,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 21:48:09,802 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 21:48:09,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 21:48:09,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:48:09,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 21:48:09,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 21:48:09,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 21:48:09,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 21:48:09,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 21:48:09,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 21:48:09,804 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 21:48:09,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 21:48:10,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 21:48:10,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 21:48:10,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 21:48:10,111 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 21:48:10,111 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 21:48:10,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-21 21:48:10,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9bd61999/c3b4c3050c0e474c89da9c7e9c0ea7fc/FLAGf9f0da7da [2020-10-21 21:48:10,753 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 21:48:10,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_tso.oepc.i [2020-10-21 21:48:10,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9bd61999/c3b4c3050c0e474c89da9c7e9c0ea7fc/FLAGf9f0da7da [2020-10-21 21:48:10,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9bd61999/c3b4c3050c0e474c89da9c7e9c0ea7fc [2020-10-21 21:48:10,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 21:48:11,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 21:48:11,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 21:48:11,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 21:48:11,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 21:48:11,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:48:10" (1/1) ... [2020-10-21 21:48:11,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207f4874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11, skipping insertion in model container [2020-10-21 21:48:11,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:48:10" (1/1) ... [2020-10-21 21:48:11,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 21:48:11,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 21:48:11,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:48:11,646 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 21:48:11,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:48:11,855 INFO L208 MainTranslator]: Completed translation [2020-10-21 21:48:11,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11 WrapperNode [2020-10-21 21:48:11,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 21:48:11,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 21:48:11,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 21:48:11,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 21:48:11,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,888 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 21:48:11,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 21:48:11,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 21:48:11,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 21:48:11,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (1/1) ... [2020-10-21 21:48:11,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 21:48:11,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 21:48:11,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 21:48:11,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 21:48:11,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (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-21 21:48:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 21:48:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 21:48:12,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 21:48:12,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 21:48:12,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 21:48:12,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 21:48:12,059 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 21:48:12,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 21:48:12,059 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 21:48:12,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 21:48:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 21:48:12,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 21:48:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 21:48:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 21:48:12,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 21:48:12,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 21:48:12,063 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 21:48:14,545 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 21:48:14,546 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 21:48:14,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:48:14 BoogieIcfgContainer [2020-10-21 21:48:14,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 21:48:14,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 21:48:14,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 21:48:14,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 21:48:14,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 09:48:10" (1/3) ... [2020-10-21 21:48:14,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119ba282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:48:14, skipping insertion in model container [2020-10-21 21:48:14,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:48:11" (2/3) ... [2020-10-21 21:48:14,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119ba282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:48:14, skipping insertion in model container [2020-10-21 21:48:14,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:48:14" (3/3) ... [2020-10-21 21:48:14,559 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2020-10-21 21:48:14,572 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 21:48:14,572 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 21:48:14,581 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 21:48:14,582 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 21:48:14,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,617 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,618 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,621 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,621 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,622 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,622 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,622 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,623 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,623 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,630 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,630 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,638 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,639 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,647 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,647 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,649 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,649 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,653 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:48:14,656 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 21:48:14,670 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 21:48:14,692 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 21:48:14,693 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 21:48:14,693 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 21:48:14,693 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 21:48:14,693 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 21:48:14,693 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 21:48:14,693 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 21:48:14,693 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 21:48:14,708 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 21:48:14,712 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 124 transitions, 268 flow [2020-10-21 21:48:14,715 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 124 transitions, 268 flow [2020-10-21 21:48:14,717 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 134 places, 124 transitions, 268 flow [2020-10-21 21:48:14,774 INFO L129 PetriNetUnfolder]: 3/120 cut-off events. [2020-10-21 21:48:14,774 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 21:48:14,780 INFO L80 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-10-21 21:48:14,785 INFO L116 LiptonReduction]: Number of co-enabled transitions 3126 [2020-10-21 21:48:14,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:14,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:14,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:14,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:14,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:14,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:14,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:14,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:14,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:14,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:14,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:14,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:14,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:14,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:14,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:14,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-21 21:48:15,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 21:48:15,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-21 21:48:15,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 21:48:15,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-21 21:48:15,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 21:48:15,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-21 21:48:15,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 21:48:15,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:15,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:15,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:15,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 3, 2, 1] term [2020-10-21 21:48:15,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 1] term [2020-10-21 21:48:15,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:15,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-21 21:48:15,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:15,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 21:48:15,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:17,263 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2020-10-21 21:48:17,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 2, 2, 1] term [2020-10-21 21:48:17,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:17,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 21:48:17,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,014 WARN L193 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 151 DAG size of output: 131 [2020-10-21 21:48:19,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-21 21:48:19,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 21:48:19,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-21 21:48:19,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-21 21:48:19,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:19,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:19,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:19,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:48:19,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:19,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:19,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 7, 6, 1] term [2020-10-21 21:48:19,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:19,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:19,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 7, 6, 1] term [2020-10-21 21:48:19,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:19,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:19,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:19,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:19,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:19,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:48:19,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:19,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 7, 6, 1] term [2020-10-21 21:48:20,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:48:20,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:48:20,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 7, 6, 1] term [2020-10-21 21:48:20,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 7, 6, 1] term [2020-10-21 21:48:20,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:48:20,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:48:20,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 7, 6, 1] term [2020-10-21 21:48:20,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 7, 6, 1] term [2020-10-21 21:48:20,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:20,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:20,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:20,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:48:20,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:20,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:21,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:21,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:48:21,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:21,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:21,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:21,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:21,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 7, 6, 1] term [2020-10-21 21:48:21,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:21,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:21,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:21,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:21,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:21,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:21,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:21,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:21,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:21,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 7, 6, 7, 6, 1] term [2020-10-21 21:48:21,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:21,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:21,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:21,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 7, 6, 7, 6, 7, 6, 3, 2, 3, 2, 1] term [2020-10-21 21:48:21,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:48:22,021 WARN L193 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 130 [2020-10-21 21:48:22,467 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-21 21:48:22,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:48:22,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:22,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:48:22,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:22,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:48:22,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:22,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:48:22,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:22,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:22,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:22,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:22,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:22,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:22,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:22,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:22,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:22,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:22,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:22,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:22,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:22,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:48:22,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:22,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:48:22,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:48:23,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:48:23,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:23,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:48:23,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:23,200 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-21 21:48:23,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:48:23,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:48:23,522 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-21 21:48:23,633 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-21 21:48:24,095 WARN L193 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-21 21:48:24,325 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-21 21:48:24,337 INFO L131 LiptonReduction]: Checked pairs total: 9993 [2020-10-21 21:48:24,337 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-21 21:48:24,344 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2020-10-21 21:48:24,883 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6912 states. [2020-10-21 21:48:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6912 states. [2020-10-21 21:48:24,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-21 21:48:24,892 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:24,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-21 21:48:24,893 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:24,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1203915438, now seen corresponding path program 1 times [2020-10-21 21:48:24,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:24,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733566243] [2020-10-21 21:48:24,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:25,194 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-21 21:48:25,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733566243] [2020-10-21 21:48:25,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:25,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:48:25,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007592357] [2020-10-21 21:48:25,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:48:25,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:25,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:48:25,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:48:25,222 INFO L87 Difference]: Start difference. First operand 6912 states. Second operand 3 states. [2020-10-21 21:48:25,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:25,408 INFO L93 Difference]: Finished difference Result 5762 states and 23320 transitions. [2020-10-21 21:48:25,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:48:25,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-21 21:48:25,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:25,486 INFO L225 Difference]: With dead ends: 5762 [2020-10-21 21:48:25,486 INFO L226 Difference]: Without dead ends: 4862 [2020-10-21 21:48:25,488 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-21 21:48:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2020-10-21 21:48:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2020-10-21 21:48:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4862 states. [2020-10-21 21:48:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2020-10-21 21:48:25,774 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 5 [2020-10-21 21:48:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:25,774 INFO L481 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2020-10-21 21:48:25,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:48:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2020-10-21 21:48:25,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 21:48:25,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:25,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:48:25,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 21:48:25,780 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:25,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1058355986, now seen corresponding path program 1 times [2020-10-21 21:48:25,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:25,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907957684] [2020-10-21 21:48:25,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:25,871 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-21 21:48:25,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907957684] [2020-10-21 21:48:25,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:25,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:48:25,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380565573] [2020-10-21 21:48:25,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:48:25,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:25,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:48:25,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:48:25,875 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand 3 states. [2020-10-21 21:48:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:25,929 INFO L93 Difference]: Finished difference Result 3262 states and 11480 transitions. [2020-10-21 21:48:25,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:48:25,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-21 21:48:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:25,958 INFO L225 Difference]: With dead ends: 3262 [2020-10-21 21:48:25,959 INFO L226 Difference]: Without dead ends: 3262 [2020-10-21 21:48:25,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-21 21:48:25,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-10-21 21:48:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2020-10-21 21:48:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-10-21 21:48:26,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 11480 transitions. [2020-10-21 21:48:26,096 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 11480 transitions. Word has length 12 [2020-10-21 21:48:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:26,097 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 11480 transitions. [2020-10-21 21:48:26,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:48:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 11480 transitions. [2020-10-21 21:48:26,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 21:48:26,106 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:26,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:48:26,107 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 21:48:26,107 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:26,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1503210283, now seen corresponding path program 1 times [2020-10-21 21:48:26,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:26,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600983194] [2020-10-21 21:48:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:26,354 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-21 21:48:26,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600983194] [2020-10-21 21:48:26,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:26,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:48:26,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471989600] [2020-10-21 21:48:26,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:48:26,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:48:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:48:26,357 INFO L87 Difference]: Start difference. First operand 3262 states and 11480 transitions. Second operand 4 states. [2020-10-21 21:48:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:26,406 INFO L93 Difference]: Finished difference Result 1822 states and 5720 transitions. [2020-10-21 21:48:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 21:48:26,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-21 21:48:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:26,420 INFO L225 Difference]: With dead ends: 1822 [2020-10-21 21:48:26,420 INFO L226 Difference]: Without dead ends: 1822 [2020-10-21 21:48:26,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:48:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2020-10-21 21:48:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1822. [2020-10-21 21:48:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1822 states. [2020-10-21 21:48:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 5720 transitions. [2020-10-21 21:48:26,481 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 5720 transitions. Word has length 16 [2020-10-21 21:48:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:26,481 INFO L481 AbstractCegarLoop]: Abstraction has 1822 states and 5720 transitions. [2020-10-21 21:48:26,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:48:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 5720 transitions. [2020-10-21 21:48:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 21:48:26,485 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:26,486 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-21 21:48:26,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 21:48:26,486 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash 473294089, now seen corresponding path program 1 times [2020-10-21 21:48:26,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:26,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753054425] [2020-10-21 21:48:26,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:26,567 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-21 21:48:26,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753054425] [2020-10-21 21:48:26,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:26,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:48:26,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767307658] [2020-10-21 21:48:26,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:48:26,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:26,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:48:26,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:48:26,573 INFO L87 Difference]: Start difference. First operand 1822 states and 5720 transitions. Second operand 5 states. [2020-10-21 21:48:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:26,634 INFO L93 Difference]: Finished difference Result 1338 states and 4268 transitions. [2020-10-21 21:48:26,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:48:26,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-21 21:48:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:26,644 INFO L225 Difference]: With dead ends: 1338 [2020-10-21 21:48:26,644 INFO L226 Difference]: Without dead ends: 1338 [2020-10-21 21:48:26,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:48:26,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2020-10-21 21:48:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1338. [2020-10-21 21:48:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1338 states. [2020-10-21 21:48:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 4268 transitions. [2020-10-21 21:48:26,694 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 4268 transitions. Word has length 20 [2020-10-21 21:48:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:26,695 INFO L481 AbstractCegarLoop]: Abstraction has 1338 states and 4268 transitions. [2020-10-21 21:48:26,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:48:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 4268 transitions. [2020-10-21 21:48:26,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-21 21:48:26,700 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:26,701 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, 1] [2020-10-21 21:48:26,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 21:48:26,701 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:26,701 INFO L82 PathProgramCache]: Analyzing trace with hash -937745403, now seen corresponding path program 1 times [2020-10-21 21:48:26,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:26,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246665693] [2020-10-21 21:48:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:26,791 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-21 21:48:26,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246665693] [2020-10-21 21:48:26,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:26,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:48:26,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881523658] [2020-10-21 21:48:26,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:48:26,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:26,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:48:26,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:48:26,794 INFO L87 Difference]: Start difference. First operand 1338 states and 4268 transitions. Second operand 6 states. [2020-10-21 21:48:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:26,865 INFO L93 Difference]: Finished difference Result 1266 states and 4124 transitions. [2020-10-21 21:48:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:48:26,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-21 21:48:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:26,876 INFO L225 Difference]: With dead ends: 1266 [2020-10-21 21:48:26,876 INFO L226 Difference]: Without dead ends: 1266 [2020-10-21 21:48:26,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:48:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2020-10-21 21:48:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2020-10-21 21:48:26,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1266 states. [2020-10-21 21:48:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4124 transitions. [2020-10-21 21:48:26,918 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 4124 transitions. Word has length 25 [2020-10-21 21:48:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:26,919 INFO L481 AbstractCegarLoop]: Abstraction has 1266 states and 4124 transitions. [2020-10-21 21:48:26,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:48:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 4124 transitions. [2020-10-21 21:48:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 21:48:26,923 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:26,923 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, 1, 1, 1, 1, 1, 1] [2020-10-21 21:48:26,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 21:48:26,924 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:26,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1951032970, now seen corresponding path program 1 times [2020-10-21 21:48:26,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:26,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454232261] [2020-10-21 21:48:26,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:27,110 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-21 21:48:27,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454232261] [2020-10-21 21:48:27,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:27,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:48:27,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252388681] [2020-10-21 21:48:27,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:48:27,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:48:27,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:48:27,113 INFO L87 Difference]: Start difference. First operand 1266 states and 4124 transitions. Second operand 6 states. [2020-10-21 21:48:27,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:27,201 INFO L93 Difference]: Finished difference Result 1629 states and 5225 transitions. [2020-10-21 21:48:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:48:27,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-10-21 21:48:27,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:27,206 INFO L225 Difference]: With dead ends: 1629 [2020-10-21 21:48:27,207 INFO L226 Difference]: Without dead ends: 618 [2020-10-21 21:48:27,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:48:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-21 21:48:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2020-10-21 21:48:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2020-10-21 21:48:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1816 transitions. [2020-10-21 21:48:27,225 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1816 transitions. Word has length 30 [2020-10-21 21:48:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:27,226 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 1816 transitions. [2020-10-21 21:48:27,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:48:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1816 transitions. [2020-10-21 21:48:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 21:48:27,228 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:27,228 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, 1, 1, 1, 1, 1, 1] [2020-10-21 21:48:27,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 21:48:27,229 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1119204216, now seen corresponding path program 2 times [2020-10-21 21:48:27,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:27,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624444798] [2020-10-21 21:48:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:48:27,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624444798] [2020-10-21 21:48:27,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:27,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:48:27,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638280887] [2020-10-21 21:48:27,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:48:27,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:27,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:48:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:48:27,459 INFO L87 Difference]: Start difference. First operand 618 states and 1816 transitions. Second operand 7 states. [2020-10-21 21:48:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:27,673 INFO L93 Difference]: Finished difference Result 871 states and 2544 transitions. [2020-10-21 21:48:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 21:48:27,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-10-21 21:48:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:27,677 INFO L225 Difference]: With dead ends: 871 [2020-10-21 21:48:27,677 INFO L226 Difference]: Without dead ends: 828 [2020-10-21 21:48:27,678 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-10-21 21:48:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2020-10-21 21:48:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 602. [2020-10-21 21:48:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-10-21 21:48:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1752 transitions. [2020-10-21 21:48:27,698 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1752 transitions. Word has length 30 [2020-10-21 21:48:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:27,698 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 1752 transitions. [2020-10-21 21:48:27,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:48:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1752 transitions. [2020-10-21 21:48:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 21:48:27,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:27,701 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, 1, 1, 1, 1, 1, 1] [2020-10-21 21:48:27,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 21:48:27,701 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:27,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1753824470, now seen corresponding path program 3 times [2020-10-21 21:48:27,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:27,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416297356] [2020-10-21 21:48:27,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:27,970 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-21 21:48:27,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416297356] [2020-10-21 21:48:27,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:27,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-21 21:48:27,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989653230] [2020-10-21 21:48:27,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-21 21:48:27,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:27,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-21 21:48:27,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-21 21:48:27,972 INFO L87 Difference]: Start difference. First operand 602 states and 1752 transitions. Second operand 9 states. [2020-10-21 21:48:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:28,165 INFO L93 Difference]: Finished difference Result 821 states and 2385 transitions. [2020-10-21 21:48:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:48:28,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-10-21 21:48:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:28,170 INFO L225 Difference]: With dead ends: 821 [2020-10-21 21:48:28,171 INFO L226 Difference]: Without dead ends: 754 [2020-10-21 21:48:28,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:48:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2020-10-21 21:48:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 574. [2020-10-21 21:48:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2020-10-21 21:48:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1668 transitions. [2020-10-21 21:48:28,189 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1668 transitions. Word has length 30 [2020-10-21 21:48:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:28,189 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 1668 transitions. [2020-10-21 21:48:28,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-21 21:48:28,190 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1668 transitions. [2020-10-21 21:48:28,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 21:48:28,192 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:28,192 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, 1, 1, 1, 1, 1, 1] [2020-10-21 21:48:28,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 21:48:28,192 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:28,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:28,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1297586452, now seen corresponding path program 4 times [2020-10-21 21:48:28,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:28,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509640077] [2020-10-21 21:48:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:28,556 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-21 21:48:28,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509640077] [2020-10-21 21:48:28,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:28,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:48:28,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540467159] [2020-10-21 21:48:28,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 21:48:28,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:28,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 21:48:28,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:48:28,559 INFO L87 Difference]: Start difference. First operand 574 states and 1668 transitions. Second operand 8 states. [2020-10-21 21:48:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:28,727 INFO L93 Difference]: Finished difference Result 813 states and 2333 transitions. [2020-10-21 21:48:28,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:48:28,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-10-21 21:48:28,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:28,731 INFO L225 Difference]: With dead ends: 813 [2020-10-21 21:48:28,732 INFO L226 Difference]: Without dead ends: 706 [2020-10-21 21:48:28,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:48:28,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-10-21 21:48:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 542. [2020-10-21 21:48:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-10-21 21:48:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1548 transitions. [2020-10-21 21:48:28,748 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1548 transitions. Word has length 30 [2020-10-21 21:48:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:28,748 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 1548 transitions. [2020-10-21 21:48:28,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 21:48:28,749 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1548 transitions. [2020-10-21 21:48:28,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 21:48:28,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:28,751 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, 1, 1, 1, 1, 1, 1] [2020-10-21 21:48:28,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 21:48:28,751 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash 614182370, now seen corresponding path program 5 times [2020-10-21 21:48:28,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:28,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660798117] [2020-10-21 21:48:28,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:48:29,268 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-21 21:48:29,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660798117] [2020-10-21 21:48:29,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:48:29,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-21 21:48:29,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470066506] [2020-10-21 21:48:29,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-21 21:48:29,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:48:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-21 21:48:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-21 21:48:29,270 INFO L87 Difference]: Start difference. First operand 542 states and 1548 transitions. Second operand 10 states. [2020-10-21 21:48:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:48:29,624 INFO L93 Difference]: Finished difference Result 901 states and 2509 transitions. [2020-10-21 21:48:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:48:29,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2020-10-21 21:48:29,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:48:29,629 INFO L225 Difference]: With dead ends: 901 [2020-10-21 21:48:29,629 INFO L226 Difference]: Without dead ends: 730 [2020-10-21 21:48:29,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-21 21:48:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2020-10-21 21:48:29,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 482. [2020-10-21 21:48:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-21 21:48:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1386 transitions. [2020-10-21 21:48:29,645 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1386 transitions. Word has length 30 [2020-10-21 21:48:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:48:29,645 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1386 transitions. [2020-10-21 21:48:29,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-21 21:48:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1386 transitions. [2020-10-21 21:48:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-21 21:48:29,647 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:48:29,648 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, 1, 1, 1, 1, 1, 1] [2020-10-21 21:48:29,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 21:48:29,648 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:48:29,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:48:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash -117790562, now seen corresponding path program 6 times [2020-10-21 21:48:29,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:48:29,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312865862] [2020-10-21 21:48:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:48:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:48:29,713 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:48:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:48:29,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:48:29,813 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 21:48:29,813 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 21:48:29,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 21:48:29,842 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-21 21:48:29,842 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,843 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-21 21:48:29,843 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773] [2020-10-21 21:48:29,845 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-21 21:48:29,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,846 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-21 21:48:29,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,846 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-21 21:48:29,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,846 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-21 21:48:29,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,847 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-21 21:48:29,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,848 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-21 21:48:29,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,848 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-21 21:48:29,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,849 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-21 21:48:29,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,849 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-21 21:48:29,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,849 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-21 21:48:29,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,850 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-21 21:48:29,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,850 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-21 21:48:29,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,851 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-21 21:48:29,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,851 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-21 21:48:29,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,851 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-21 21:48:29,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,852 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-21 21:48:29,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,852 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-21 21:48:29,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,853 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-21 21:48:29,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,853 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-21 21:48:29,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,853 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-21 21:48:29,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,854 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-21 21:48:29,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,854 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-21 21:48:29,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,855 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-21 21:48:29,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,855 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-21 21:48:29,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,856 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-21 21:48:29,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,856 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-21 21:48:29,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,856 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-21 21:48:29,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,857 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-21 21:48:29,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,857 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-21 21:48:29,857 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,858 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-21 21:48:29,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,858 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-21 21:48:29,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,858 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-21 21:48:29,858 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,859 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-21 21:48:29,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,859 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-21 21:48:29,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,859 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-21 21:48:29,859 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,860 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-21 21:48:29,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,860 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-21 21:48:29,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,860 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-21 21:48:29,860 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:48:29,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 09:48:29 BasicIcfg [2020-10-21 21:48:29,968 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 21:48:29,972 INFO L168 Benchmark]: Toolchain (without parser) took 18976.91 ms. Allocated memory was 144.7 MB in the beginning and 458.2 MB in the end (delta: 313.5 MB). Free memory was 99.5 MB in the beginning and 118.3 MB in the end (delta: -18.8 MB). Peak memory consumption was 294.8 MB. Max. memory is 7.1 GB. [2020-10-21 21:48:29,973 INFO L168 Benchmark]: CDTParser took 4.05 ms. Allocated memory is still 144.7 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. [2020-10-21 21:48:29,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.88 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 98.7 MB in the beginning and 150.4 MB in the end (delta: -51.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-21 21:48:29,975 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.80 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 147.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-21 21:48:29,977 INFO L168 Benchmark]: Boogie Preprocessor took 43.75 ms. Allocated memory is still 201.3 MB. Free memory was 147.3 MB in the beginning and 144.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2020-10-21 21:48:29,978 INFO L168 Benchmark]: RCFGBuilder took 2574.48 ms. Allocated memory was 201.3 MB in the beginning and 253.2 MB in the end (delta: 51.9 MB). Free memory was 144.2 MB in the beginning and 134.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. [2020-10-21 21:48:29,980 INFO L168 Benchmark]: TraceAbstraction took 15417.12 ms. Allocated memory was 253.2 MB in the beginning and 458.2 MB in the end (delta: 205.0 MB). Free memory was 134.5 MB in the beginning and 118.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 221.1 MB. Max. memory is 7.1 GB. [2020-10-21 21:48:29,987 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.05 ms. Allocated memory is still 144.7 MB. Free memory was 119.4 MB in the beginning and 119.0 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 853.88 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 98.7 MB in the beginning and 150.4 MB in the end (delta: -51.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.80 ms. Allocated memory is still 201.3 MB. Free memory was 150.4 MB in the beginning and 147.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.75 ms. Allocated memory is still 201.3 MB. Free memory was 147.3 MB in the beginning and 144.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2574.48 ms. Allocated memory was 201.3 MB in the beginning and 253.2 MB in the end (delta: 51.9 MB). Free memory was 144.2 MB in the beginning and 134.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 99.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15417.12 ms. Allocated memory was 253.2 MB in the beginning and 458.2 MB in the end (delta: 205.0 MB). Free memory was 134.5 MB in the beginning and 118.3 MB in the end (delta: 16.2 MB). Peak memory consumption was 221.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2155 VarBasedMoverChecksPositive, 116 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 73 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.1s, 304 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.6s, 134 PlacesBefore, 49 PlacesAfterwards, 124 TransitionsBefore, 37 TransitionsAfterwards, 3126 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 9993 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND TRUE 2 !expression [L17] COND FALSE 2 !(0) [L17] 2 __assert_fail ("0", "mix005_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L864] 0 pthread_t t148; [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L817] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L754] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix005_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 122 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 358 SDtfs, 509 SDslu, 1072 SDs, 0 SdLazy, 408 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6912occurred 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.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 818 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 72126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...