/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/mix018_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 21:50:25,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 21:50:25,623 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 21:50:25,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 21:50:25,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 21:50:25,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 21:50:25,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 21:50:25,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 21:50:25,682 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 21:50:25,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 21:50:25,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 21:50:25,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 21:50:25,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 21:50:25,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 21:50:25,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 21:50:25,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 21:50:25,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 21:50:25,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 21:50:25,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 21:50:25,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 21:50:25,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 21:50:25,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 21:50:25,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 21:50:25,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 21:50:25,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 21:50:25,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 21:50:25,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 21:50:25,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 21:50:25,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 21:50:25,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 21:50:25,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 21:50:25,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 21:50:25,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 21:50:25,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 21:50:25,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 21:50:25,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 21:50:25,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 21:50:25,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 21:50:25,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 21:50:25,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 21:50:25,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 21:50:25,744 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:50:25,775 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 21:50:25,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 21:50:25,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 21:50:25,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 21:50:25,779 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 21:50:25,779 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 21:50:25,779 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 21:50:25,779 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 21:50:25,780 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 21:50:25,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 21:50:25,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 21:50:25,780 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 21:50:25,780 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 21:50:25,780 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 21:50:25,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 21:50:25,781 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 21:50:25,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 21:50:25,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 21:50:25,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 21:50:25,782 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 21:50:25,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 21:50:25,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 21:50:25,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 21:50:25,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-21 21:50:25,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 21:50:25,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 21:50:25,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 21:50:25,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 21:50:25,785 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-21 21:50:25,785 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-21 21:50:26,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 21:50:26,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 21:50:26,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 21:50:26,106 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 21:50:26,107 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 21:50:26,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_power.opt.i [2020-10-21 21:50:26,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e5675b2/b13cd924bd0c4dd7a6a9b1aa13a061b1/FLAGb795fe8b7 [2020-10-21 21:50:26,706 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 21:50:26,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_power.opt.i [2020-10-21 21:50:26,727 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e5675b2/b13cd924bd0c4dd7a6a9b1aa13a061b1/FLAGb795fe8b7 [2020-10-21 21:50:27,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e5675b2/b13cd924bd0c4dd7a6a9b1aa13a061b1 [2020-10-21 21:50:27,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 21:50:27,046 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 21:50:27,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 21:50:27,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 21:50:27,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 21:50:27,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:27,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e75f197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27, skipping insertion in model container [2020-10-21 21:50:27,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:27,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 21:50:27,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 21:50:27,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:50:27,651 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 21:50:27,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 21:50:27,868 INFO L208 MainTranslator]: Completed translation [2020-10-21 21:50:27,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27 WrapperNode [2020-10-21 21:50:27,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 21:50:27,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 21:50:27,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 21:50:27,878 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 21:50:27,887 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:50:27" (1/1) ... [2020-10-21 21:50:27,930 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:50:27" (1/1) ... [2020-10-21 21:50:27,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 21:50:27,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 21:50:27,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 21:50:27,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 21:50:27,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:27,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:27,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:27,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:28,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:28,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:28,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (1/1) ... [2020-10-21 21:50:28,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 21:50:28,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 21:50:28,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 21:50:28,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 21:50:28,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (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:50:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 21:50:28,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 21:50:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 21:50:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 21:50:28,108 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 21:50:28,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 21:50:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 21:50:28,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 21:50:28,109 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 21:50:28,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 21:50:28,110 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 21:50:28,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 21:50:28,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 21:50:28,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 21:50:28,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 21:50:28,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 21:50:28,118 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:50:30,555 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 21:50:30,556 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 21:50:30,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:50:30 BoogieIcfgContainer [2020-10-21 21:50:30,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 21:50:30,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 21:50:30,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 21:50:30,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 21:50:30,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 09:50:27" (1/3) ... [2020-10-21 21:50:30,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8ce42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:50:30, skipping insertion in model container [2020-10-21 21:50:30,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 09:50:27" (2/3) ... [2020-10-21 21:50:30,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8ce42e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 09:50:30, skipping insertion in model container [2020-10-21 21:50:30,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 09:50:30" (3/3) ... [2020-10-21 21:50:30,568 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_power.opt.i [2020-10-21 21:50:30,580 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 21:50:30,580 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-21 21:50:30,589 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 21:50:30,590 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 21:50:30,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,628 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,631 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,632 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,633 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,634 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,635 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,638 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,638 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,639 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,639 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,640 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,676 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,676 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,677 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,677 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,677 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,677 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,678 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,679 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,689 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,689 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,690 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,690 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,694 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,697 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,697 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,702 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,703 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,704 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,705 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 21:50:30,708 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 21:50:30,723 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 21:50:30,746 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 21:50:30,746 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 21:50:30,746 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-21 21:50:30,746 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 21:50:30,746 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 21:50:30,747 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 21:50:30,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 21:50:30,747 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 21:50:30,762 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-21 21:50:30,765 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 119 transitions, 258 flow [2020-10-21 21:50:30,768 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 119 transitions, 258 flow [2020-10-21 21:50:30,770 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 119 transitions, 258 flow [2020-10-21 21:50:30,825 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-10-21 21:50:30,825 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 21:50:30,830 INFO L80 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-21 21:50:30,835 INFO L116 LiptonReduction]: Number of co-enabled transitions 2610 [2020-10-21 21:50:31,140 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 21:50:31,299 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-21 21:50:31,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-21 21:50:31,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:50:31,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:31,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-21 21:50:31,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:31,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-21 21:50:31,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:31,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:31,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:31,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:31,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:31,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:31,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:31,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:31,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:31,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:31,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:31,878 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:31,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:31,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:31,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:31,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:31,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:31,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:31,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:31,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:31,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:31,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:31,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:31,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:31,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:31,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:32,491 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-21 21:50:32,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:32,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:32,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:32,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:32,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:32,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:32,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:32,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:32,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:32,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:32,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:32,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:33,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:33,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:33,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:33,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:33,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:33,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:50:33,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:33,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:33,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:33,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:33,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:33,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:33,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,721 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 21:50:33,834 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 21:50:33,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:33,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:33,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:33,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:33,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:33,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:33,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:33,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:33,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:33,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:33,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:33,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:34,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:34,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:34,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:34,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:34,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:34,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:50:34,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:34,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:34,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:34,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:34,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:34,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:34,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:34,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:34,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-21 21:50:34,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-21 21:50:34,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-21 21:50:34,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:34,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:34,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:34,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-21 21:50:34,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-21 21:50:34,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 21:50:34,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-21 21:50:34,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-21 21:50:34,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-21 21:50:34,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-21 21:50:35,406 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 90 [2020-10-21 21:50:35,522 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-21 21:50:35,972 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-21 21:50:36,177 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-21 21:50:36,186 INFO L131 LiptonReduction]: Checked pairs total: 6730 [2020-10-21 21:50:36,186 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-21 21:50:36,194 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-21 21:50:36,374 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2858 states. [2020-10-21 21:50:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states. [2020-10-21 21:50:36,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 21:50:36,385 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:36,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:36,387 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1119410185, now seen corresponding path program 1 times [2020-10-21 21:50:36,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:36,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437827609] [2020-10-21 21:50:36,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:36,728 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:50:36,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437827609] [2020-10-21 21:50:36,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:36,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 21:50:36,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266943513] [2020-10-21 21:50:36,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 21:50:36,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:36,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 21:50:36,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 21:50:36,755 INFO L87 Difference]: Start difference. First operand 2858 states. Second operand 3 states. [2020-10-21 21:50:36,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:36,886 INFO L93 Difference]: Finished difference Result 2474 states and 9536 transitions. [2020-10-21 21:50:36,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 21:50:36,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 21:50:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:36,955 INFO L225 Difference]: With dead ends: 2474 [2020-10-21 21:50:36,955 INFO L226 Difference]: Without dead ends: 2090 [2020-10-21 21:50:36,957 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:50:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-10-21 21:50:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-10-21 21:50:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-10-21 21:50:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7968 transitions. [2020-10-21 21:50:37,161 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7968 transitions. Word has length 9 [2020-10-21 21:50:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:37,162 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7968 transitions. [2020-10-21 21:50:37,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 21:50:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7968 transitions. [2020-10-21 21:50:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 21:50:37,173 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:37,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:37,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 21:50:37,174 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:37,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2073594623, now seen corresponding path program 1 times [2020-10-21 21:50:37,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:37,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435406588] [2020-10-21 21:50:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:37,353 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:50:37,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435406588] [2020-10-21 21:50:37,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:37,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:50:37,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333445616] [2020-10-21 21:50:37,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:50:37,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:37,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:50:37,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:50:37,357 INFO L87 Difference]: Start difference. First operand 2090 states and 7968 transitions. Second operand 4 states. [2020-10-21 21:50:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:37,445 INFO L93 Difference]: Finished difference Result 2378 states and 8760 transitions. [2020-10-21 21:50:37,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:37,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 21:50:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:37,464 INFO L225 Difference]: With dead ends: 2378 [2020-10-21 21:50:37,464 INFO L226 Difference]: Without dead ends: 1994 [2020-10-21 21:50:37,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:37,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2020-10-21 21:50:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2020-10-21 21:50:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2020-10-21 21:50:37,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 7528 transitions. [2020-10-21 21:50:37,542 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 7528 transitions. Word has length 12 [2020-10-21 21:50:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:37,543 INFO L481 AbstractCegarLoop]: Abstraction has 1994 states and 7528 transitions. [2020-10-21 21:50:37,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:50:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 7528 transitions. [2020-10-21 21:50:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 21:50:37,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:37,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:37,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 21:50:37,545 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2013181085, now seen corresponding path program 1 times [2020-10-21 21:50:37,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:37,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610661715] [2020-10-21 21:50:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:37,625 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:50:37,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610661715] [2020-10-21 21:50:37,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:37,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 21:50:37,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704533502] [2020-10-21 21:50:37,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:50:37,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:37,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:50:37,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:50:37,627 INFO L87 Difference]: Start difference. First operand 1994 states and 7528 transitions. Second operand 4 states. [2020-10-21 21:50:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:37,686 INFO L93 Difference]: Finished difference Result 2106 states and 7716 transitions. [2020-10-21 21:50:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:37,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 21:50:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:37,702 INFO L225 Difference]: With dead ends: 2106 [2020-10-21 21:50:37,702 INFO L226 Difference]: Without dead ends: 1770 [2020-10-21 21:50:37,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2020-10-21 21:50:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1770. [2020-10-21 21:50:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1770 states. [2020-10-21 21:50:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 6592 transitions. [2020-10-21 21:50:37,790 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 6592 transitions. Word has length 13 [2020-10-21 21:50:37,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:37,791 INFO L481 AbstractCegarLoop]: Abstraction has 1770 states and 6592 transitions. [2020-10-21 21:50:37,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:50:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 6592 transitions. [2020-10-21 21:50:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 21:50:37,796 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:37,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:37,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 21:50:37,797 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:37,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:37,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2110260791, now seen corresponding path program 1 times [2020-10-21 21:50:37,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:37,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172919268] [2020-10-21 21:50:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:38,084 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:50:38,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172919268] [2020-10-21 21:50:38,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:38,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:50:38,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902773681] [2020-10-21 21:50:38,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:50:38,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:50:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:50:38,086 INFO L87 Difference]: Start difference. First operand 1770 states and 6592 transitions. Second operand 4 states. [2020-10-21 21:50:38,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:38,148 INFO L93 Difference]: Finished difference Result 1758 states and 5931 transitions. [2020-10-21 21:50:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:38,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-21 21:50:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:38,159 INFO L225 Difference]: With dead ends: 1758 [2020-10-21 21:50:38,159 INFO L226 Difference]: Without dead ends: 1374 [2020-10-21 21:50:38,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-10-21 21:50:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1374. [2020-10-21 21:50:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2020-10-21 21:50:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 4612 transitions. [2020-10-21 21:50:38,210 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 4612 transitions. Word has length 15 [2020-10-21 21:50:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:38,210 INFO L481 AbstractCegarLoop]: Abstraction has 1374 states and 4612 transitions. [2020-10-21 21:50:38,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:50:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 4612 transitions. [2020-10-21 21:50:38,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 21:50:38,213 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:38,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:38,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 21:50:38,214 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash 908266600, now seen corresponding path program 1 times [2020-10-21 21:50:38,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:38,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290560781] [2020-10-21 21:50:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:50:38,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290560781] [2020-10-21 21:50:38,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:38,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:50:38,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808872986] [2020-10-21 21:50:38,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:50:38,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:50:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:38,308 INFO L87 Difference]: Start difference. First operand 1374 states and 4612 transitions. Second operand 5 states. [2020-10-21 21:50:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:38,371 INFO L93 Difference]: Finished difference Result 1107 states and 3354 transitions. [2020-10-21 21:50:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 21:50:38,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-21 21:50:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:38,378 INFO L225 Difference]: With dead ends: 1107 [2020-10-21 21:50:38,378 INFO L226 Difference]: Without dead ends: 858 [2020-10-21 21:50:38,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:50:38,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2020-10-21 21:50:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2020-10-21 21:50:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2020-10-21 21:50:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 2548 transitions. [2020-10-21 21:50:38,404 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 2548 transitions. Word has length 17 [2020-10-21 21:50:38,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:38,404 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 2548 transitions. [2020-10-21 21:50:38,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:50:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 2548 transitions. [2020-10-21 21:50:38,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 21:50:38,407 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:38,407 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:50:38,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 21:50:38,408 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:38,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:38,408 INFO L82 PathProgramCache]: Analyzing trace with hash 525076766, now seen corresponding path program 1 times [2020-10-21 21:50:38,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:38,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375959980] [2020-10-21 21:50:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:38,584 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:50:38,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375959980] [2020-10-21 21:50:38,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:38,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 21:50:38,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835147767] [2020-10-21 21:50:38,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 21:50:38,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:38,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 21:50:38,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 21:50:38,586 INFO L87 Difference]: Start difference. First operand 858 states and 2548 transitions. Second operand 6 states. [2020-10-21 21:50:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:38,658 INFO L93 Difference]: Finished difference Result 697 states and 2034 transitions. [2020-10-21 21:50:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 21:50:38,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-21 21:50:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:38,664 INFO L225 Difference]: With dead ends: 697 [2020-10-21 21:50:38,664 INFO L226 Difference]: Without dead ends: 610 [2020-10-21 21:50:38,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:50:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2020-10-21 21:50:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2020-10-21 21:50:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2020-10-21 21:50:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1804 transitions. [2020-10-21 21:50:38,682 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 1804 transitions. Word has length 20 [2020-10-21 21:50:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:38,682 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 1804 transitions. [2020-10-21 21:50:38,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 21:50:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 1804 transitions. [2020-10-21 21:50:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-21 21:50:38,685 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:38,685 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 21:50:38,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 21:50:38,685 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:38,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:38,685 INFO L82 PathProgramCache]: Analyzing trace with hash 58948854, now seen corresponding path program 1 times [2020-10-21 21:50:38,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:38,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265458497] [2020-10-21 21:50:38,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:38,844 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:50:38,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265458497] [2020-10-21 21:50:38,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:38,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:50:38,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542135537] [2020-10-21 21:50:38,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 21:50:38,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:38,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 21:50:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:50:38,847 INFO L87 Difference]: Start difference. First operand 610 states and 1804 transitions. Second operand 7 states. [2020-10-21 21:50:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:38,932 INFO L93 Difference]: Finished difference Result 573 states and 1728 transitions. [2020-10-21 21:50:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 21:50:38,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-21 21:50:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:38,943 INFO L225 Difference]: With dead ends: 573 [2020-10-21 21:50:38,943 INFO L226 Difference]: Without dead ends: 558 [2020-10-21 21:50:38,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:50:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-10-21 21:50:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2020-10-21 21:50:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-10-21 21:50:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1700 transitions. [2020-10-21 21:50:38,965 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1700 transitions. Word has length 23 [2020-10-21 21:50:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:38,965 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 1700 transitions. [2020-10-21 21:50:38,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 21:50:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1700 transitions. [2020-10-21 21:50:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-21 21:50:38,970 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:38,970 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] [2020-10-21 21:50:38,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 21:50:38,970 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:38,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:38,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1354430600, now seen corresponding path program 1 times [2020-10-21 21:50:38,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:38,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723516592] [2020-10-21 21:50:38,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:39,100 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:50:39,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723516592] [2020-10-21 21:50:39,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:39,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 21:50:39,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344676668] [2020-10-21 21:50:39,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 21:50:39,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:39,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 21:50:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 21:50:39,103 INFO L87 Difference]: Start difference. First operand 558 states and 1700 transitions. Second operand 4 states. [2020-10-21 21:50:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:39,126 INFO L93 Difference]: Finished difference Result 765 states and 2265 transitions. [2020-10-21 21:50:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-21 21:50:39,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-21 21:50:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:39,129 INFO L225 Difference]: With dead ends: 765 [2020-10-21 21:50:39,130 INFO L226 Difference]: Without dead ends: 354 [2020-10-21 21:50:39,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-10-21 21:50:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2020-10-21 21:50:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-10-21 21:50:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 968 transitions. [2020-10-21 21:50:39,140 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 968 transitions. Word has length 26 [2020-10-21 21:50:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:39,142 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 968 transitions. [2020-10-21 21:50:39,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 21:50:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 968 transitions. [2020-10-21 21:50:39,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-21 21:50:39,143 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:39,144 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] [2020-10-21 21:50:39,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 21:50:39,144 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:39,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:39,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1595577788, now seen corresponding path program 2 times [2020-10-21 21:50:39,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:39,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386055371] [2020-10-21 21:50:39,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:39,293 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:50:39,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386055371] [2020-10-21 21:50:39,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:39,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 21:50:39,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490510469] [2020-10-21 21:50:39,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 21:50:39,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 21:50:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 21:50:39,297 INFO L87 Difference]: Start difference. First operand 354 states and 968 transitions. Second operand 5 states. [2020-10-21 21:50:39,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:39,332 INFO L93 Difference]: Finished difference Result 453 states and 1215 transitions. [2020-10-21 21:50:39,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 21:50:39,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-21 21:50:39,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:39,334 INFO L225 Difference]: With dead ends: 453 [2020-10-21 21:50:39,335 INFO L226 Difference]: Without dead ends: 210 [2020-10-21 21:50:39,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 21:50:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-10-21 21:50:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-10-21 21:50:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-21 21:50:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 506 transitions. [2020-10-21 21:50:39,342 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 506 transitions. Word has length 26 [2020-10-21 21:50:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:39,342 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 506 transitions. [2020-10-21 21:50:39,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 21:50:39,343 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 506 transitions. [2020-10-21 21:50:39,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-21 21:50:39,344 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:39,344 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] [2020-10-21 21:50:39,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 21:50:39,344 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:39,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:39,344 INFO L82 PathProgramCache]: Analyzing trace with hash -360224102, now seen corresponding path program 3 times [2020-10-21 21:50:39,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:39,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690742578] [2020-10-21 21:50:39,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 21:50:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-21 21:50:39,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690742578] [2020-10-21 21:50:39,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 21:50:39,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 21:50:39,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275289736] [2020-10-21 21:50:39,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-21 21:50:39,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 21:50:39,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-21 21:50:39,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-21 21:50:39,821 INFO L87 Difference]: Start difference. First operand 210 states and 506 transitions. Second operand 8 states. [2020-10-21 21:50:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 21:50:40,275 INFO L93 Difference]: Finished difference Result 273 states and 637 transitions. [2020-10-21 21:50:40,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 21:50:40,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-10-21 21:50:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 21:50:40,279 INFO L225 Difference]: With dead ends: 273 [2020-10-21 21:50:40,279 INFO L226 Difference]: Without dead ends: 226 [2020-10-21 21:50:40,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-21 21:50:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-10-21 21:50:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 182. [2020-10-21 21:50:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-10-21 21:50:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 430 transitions. [2020-10-21 21:50:40,285 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 430 transitions. Word has length 26 [2020-10-21 21:50:40,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 21:50:40,286 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 430 transitions. [2020-10-21 21:50:40,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-21 21:50:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 430 transitions. [2020-10-21 21:50:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-21 21:50:40,287 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 21:50:40,287 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] [2020-10-21 21:50:40,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 21:50:40,287 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 21:50:40,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 21:50:40,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1743424434, now seen corresponding path program 4 times [2020-10-21 21:50:40,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 21:50:40,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441165700] [2020-10-21 21:50:40,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 21:50:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:50:40,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:50:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 21:50:40,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 21:50:40,458 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 21:50:40,458 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 21:50:40,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 21:50:40,491 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:50:40,491 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,491 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:50:40,491 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [809] [2020-10-21 21:50:40,492 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:50:40,492 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,493 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:50:40,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,493 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:50:40,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,493 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:50:40,493 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,494 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:50:40,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,494 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:50:40,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,494 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:50:40,494 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,495 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:50:40,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,495 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:50:40,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,495 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:50:40,495 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,496 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:50:40,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,496 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:50:40,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,496 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:50:40,496 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,498 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:50:40,498 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,499 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:50:40,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,499 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:50:40,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,499 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:50:40,499 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,500 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:50:40,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,500 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:50:40,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,500 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:50:40,500 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,501 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:50:40,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,501 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:50:40,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,501 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:50:40,501 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,502 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:50:40,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,502 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:50:40,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,502 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:50:40,502 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,503 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:50:40,503 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,504 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:50:40,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,504 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:50:40,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,504 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:50:40,504 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,504 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:50:40,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,505 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:50:40,505 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,506 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:50:40,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,506 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:50:40,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,506 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:50:40,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,506 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:50:40,506 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,507 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:50:40,507 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 21:50:40,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 09:50:40 BasicIcfg [2020-10-21 21:50:40,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 21:50:40,590 INFO L168 Benchmark]: Toolchain (without parser) took 13550.38 ms. Allocated memory was 140.0 MB in the beginning and 466.1 MB in the end (delta: 326.1 MB). Free memory was 100.4 MB in the beginning and 271.6 MB in the end (delta: -171.1 MB). Peak memory consumption was 155.0 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:40,591 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 140.0 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-21 21:50:40,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.15 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 152.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:40,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.80 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:40,593 INFO L168 Benchmark]: Boogie Preprocessor took 47.82 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 147.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:40,594 INFO L168 Benchmark]: RCFGBuilder took 2535.01 ms. Allocated memory was 203.9 MB in the beginning and 249.6 MB in the end (delta: 45.6 MB). Free memory was 147.3 MB in the beginning and 103.6 MB in the end (delta: 43.7 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:40,594 INFO L168 Benchmark]: TraceAbstraction took 10028.46 ms. Allocated memory was 249.6 MB in the beginning and 466.1 MB in the end (delta: 216.5 MB). Free memory was 103.6 MB in the beginning and 271.6 MB in the end (delta: -168.0 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. [2020-10-21 21:50:40,598 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 140.0 MB. Free memory was 121.0 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.15 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 152.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.80 ms. Allocated memory is still 203.9 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.82 ms. Allocated memory is still 203.9 MB. Free memory was 150.1 MB in the beginning and 147.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2535.01 ms. Allocated memory was 203.9 MB in the beginning and 249.6 MB in the end (delta: 45.6 MB). Free memory was 147.3 MB in the beginning and 103.6 MB in the end (delta: 43.7 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10028.46 ms. Allocated memory was 249.6 MB in the beginning and 466.1 MB in the end (delta: 216.5 MB). Free memory was 103.6 MB in the beginning and 271.6 MB in the end (delta: -168.0 MB). Peak memory consumption was 48.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1626 VarBasedMoverChecksPositive, 58 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 161 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.4s, 129 PlacesBefore, 45 PlacesAfterwards, 119 TransitionsBefore, 33 TransitionsAfterwards, 2610 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 6730 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_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L864] 0 pthread_t t469; [L865] FCALL, FORK 0 pthread_create(&t469, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 pthread_t t470; [L867] FCALL, FORK 0 pthread_create(&t470, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 pthread_t t471; [L869] FCALL, FORK 0 pthread_create(&t471, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L870] 0 pthread_t t472; [L871] FCALL, FORK 0 pthread_create(&t472, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND TRUE 4 0 [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L824] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L825] 4 z$flush_delayed = weak$$choice2 [L826] 4 z$mem_tmp = z [L827] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L827] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L827] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L828] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L828] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L829] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L829] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L829] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L830] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used) [L830] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L830] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L831] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4) [L832] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L832] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L833] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 __unbuffered_p3_EAX = z [L835] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L835] 4 z = z$flush_delayed ? z$mem_tmp : z [L836] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=52, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L839] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=52, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L782] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=52, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L790] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L792] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L793] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L793] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L795] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=51, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L842] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L842] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L843] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L843] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L844] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L844] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L845] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L845] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L846] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L846] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L877] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L877] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L878] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L878] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L879] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L879] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L880] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L880] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L881] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L881] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=51, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix018_power.opt.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=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=51, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 117 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.7s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 344 SDtfs, 430 SDslu, 709 SDs, 0 SdLazy, 236 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2858occurred 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.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 44 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 18041 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...