/usr/bin/java -Xmx16000000000 -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/mix002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 12:27:44,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 12:27:44,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 12:27:44,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 12:27:44,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 12:27:44,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 12:27:44,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 12:27:44,463 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 12:27:44,464 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 12:27:44,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 12:27:44,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 12:27:44,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 12:27:44,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 12:27:44,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 12:27:44,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 12:27:44,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 12:27:44,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 12:27:44,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 12:27:44,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 12:27:44,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 12:27:44,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 12:27:44,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 12:27:44,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 12:27:44,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 12:27:44,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 12:27:44,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 12:27:44,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 12:27:44,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 12:27:44,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 12:27:44,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 12:27:44,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 12:27:44,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 12:27:44,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 12:27:44,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 12:27:44,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 12:27:44,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 12:27:44,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 12:27:44,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 12:27:44,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 12:27:44,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 12:27:44,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 12:27:44,494 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-09 12:27:44,517 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 12:27:44,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 12:27:44,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 12:27:44,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 12:27:44,519 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 12:27:44,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 12:27:44,520 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 12:27:44,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 12:27:44,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 12:27:44,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 12:27:44,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 12:27:44,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 12:27:44,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 12:27:44,521 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 12:27:44,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 12:27:44,522 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 12:27:44,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 12:27:44,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 12:27:44,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 12:27:44,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 12:27:44,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 12:27:44,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 12:27:44,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 12:27:44,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 12:27:44,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 12:27:44,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-09 12:27:44,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 12:27:44,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-09 12:27:44,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-09 12:27:44,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 12:27:44,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 12:27:44,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 12:27:44,841 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 12:27:44,842 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 12:27:44,843 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 12:27:44,843 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix002_power.opt.i [2020-10-09 12:27:44,909 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52240ab5/10f10693d9b343d891deab7d06876139/FLAGac9f5ac5a [2020-10-09 12:27:45,496 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 12:27:45,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix002_power.opt.i [2020-10-09 12:27:45,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52240ab5/10f10693d9b343d891deab7d06876139/FLAGac9f5ac5a [2020-10-09 12:27:45,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52240ab5/10f10693d9b343d891deab7d06876139 [2020-10-09 12:27:45,798 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 12:27:45,800 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 12:27:45,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 12:27:45,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 12:27:45,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 12:27:45,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:27:45" (1/1) ... [2020-10-09 12:27:45,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1467314f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:45, skipping insertion in model container [2020-10-09 12:27:45,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 12:27:45" (1/1) ... [2020-10-09 12:27:45,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 12:27:45,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 12:27:46,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:27:46,450 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 12:27:46,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 12:27:46,592 INFO L208 MainTranslator]: Completed translation [2020-10-09 12:27:46,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46 WrapperNode [2020-10-09 12:27:46,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 12:27:46,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 12:27:46,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 12:27:46,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 12:27:46,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,626 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 12:27:46,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 12:27:46,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 12:27:46,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 12:27:46,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (1/1) ... [2020-10-09 12:27:46,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 12:27:46,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 12:27:46,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 12:27:46,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 12:27:46,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (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-09 12:27:46,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 12:27:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 12:27:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 12:27:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 12:27:46,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 12:27:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 12:27:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 12:27:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 12:27:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 12:27:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 12:27:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 12:27:46,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 12:27:46,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 12:27:46,814 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 12:27:49,222 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 12:27:49,222 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 12:27:49,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:27:49 BoogieIcfgContainer [2020-10-09 12:27:49,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 12:27:49,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 12:27:49,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 12:27:49,230 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 12:27:49,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 12:27:45" (1/3) ... [2020-10-09 12:27:49,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e61c7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:27:49, skipping insertion in model container [2020-10-09 12:27:49,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 12:27:46" (2/3) ... [2020-10-09 12:27:49,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e61c7c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 12:27:49, skipping insertion in model container [2020-10-09 12:27:49,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 12:27:49" (3/3) ... [2020-10-09 12:27:49,234 INFO L111 eAbstractionObserver]: Analyzing ICFG mix002_power.opt.i [2020-10-09 12:27:49,245 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-09 12:27:49,245 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 12:27:49,252 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 12:27:49,253 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 12:27:49,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,287 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,287 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,288 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,289 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,298 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,298 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,298 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,299 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,313 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,313 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,317 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,320 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,325 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,326 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,327 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,329 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,332 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 12:27:49,346 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 12:27:49,365 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 12:27:49,365 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-09 12:27:49,365 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 12:27:49,366 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 12:27:49,366 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 12:27:49,366 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 12:27:49,366 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 12:27:49,366 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 12:27:49,380 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-09 12:27:49,382 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 100 transitions, 215 flow [2020-10-09 12:27:49,385 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 100 transitions, 215 flow [2020-10-09 12:27:49,387 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2020-10-09 12:27:49,437 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2020-10-09 12:27:49,437 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 12:27:49,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-09 12:27:49,446 INFO L117 LiptonReduction]: Number of co-enabled transitions 1814 [2020-10-09 12:27:50,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:50,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:50,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:50,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:50,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:50,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:50,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:50,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:50,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:50,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:50,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:50,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:50,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:50,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:50,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:50,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:50,514 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-09 12:27:50,678 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-09 12:27:50,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:50,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:50,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:50,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:50,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:50,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 12:27:51,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:51,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:27:51,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:51,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:51,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:51,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:51,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,234 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-09 12:27:51,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,236 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-09 12:27:51,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:51,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:51,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:51,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:51,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:51,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:51,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,409 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-09 12:27:51,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,411 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-09 12:27:51,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:27:51,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:51,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:51,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:51,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:51,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,618 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-09 12:27:51,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,620 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-09 12:27:51,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,766 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 12:27:51,889 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-09 12:27:51,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:51,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:51,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:51,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:51,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:51,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,944 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-09 12:27:51,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:51,946 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-09 12:27:51,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-09 12:27:52,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:52,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,270 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-09 12:27:52,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,271 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-09 12:27:52,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:52,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:52,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:52,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:52,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:52,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:52,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:52,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:52,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:52,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,522 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-09 12:27:52,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,523 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-09 12:27:52,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:52,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:52,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,646 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-09 12:27:52,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,647 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-09 12:27:52,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:52,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:52,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:52,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,734 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-09 12:27:52,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,736 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-09 12:27:52,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:52,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:52,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:52,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:52,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:53,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:53,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:53,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,140 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-09 12:27:53,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,142 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-09 12:27:53,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:53,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:53,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:53,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:53,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:53,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:53,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:53,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:53,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 12:27:53,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-09 12:27:53,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:53,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,373 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-09 12:27:53,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,374 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-09 12:27:53,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:53,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:53,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:53,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:53,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:53,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,563 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-09 12:27:53,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,564 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-09 12:27:53,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 12:27:53,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:53,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 12:27:53,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-09 12:27:53,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,610 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-09 12:27:53,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,613 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-09 12:27:53,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-09 12:27:53,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-09 12:27:53,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-09 12:27:53,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-09 12:27:53,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 12:27:54,379 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-09 12:27:54,529 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-09 12:27:54,651 INFO L132 LiptonReduction]: Checked pairs total: 5577 [2020-10-09 12:27:54,651 INFO L134 LiptonReduction]: Total number of compositions: 85 [2020-10-09 12:27:54,673 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-09 12:27:54,781 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 937 states. [2020-10-09 12:27:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states. [2020-10-09 12:27:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-09 12:27:54,797 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:54,798 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:27:54,799 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:54,809 INFO L82 PathProgramCache]: Analyzing trace with hash -621540055, now seen corresponding path program 1 times [2020-10-09 12:27:54,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:54,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114345211] [2020-10-09 12:27:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:55,370 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-09 12:27:55,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114345211] [2020-10-09 12:27:55,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:55,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:27:55,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334006342] [2020-10-09 12:27:55,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:27:55,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:55,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:27:55,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:27:55,412 INFO L87 Difference]: Start difference. First operand 937 states. Second operand 3 states. [2020-10-09 12:27:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:55,567 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-09 12:27:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:27:55,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-09 12:27:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:55,601 INFO L225 Difference]: With dead ends: 812 [2020-10-09 12:27:55,601 INFO L226 Difference]: Without dead ends: 662 [2020-10-09 12:27:55,603 INFO L673 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-09 12:27:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-09 12:27:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-09 12:27:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-09 12:27:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-10-09 12:27:55,749 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 7 [2020-10-09 12:27:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:55,751 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-10-09 12:27:55,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:27:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-10-09 12:27:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-09 12:27:55,754 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:55,754 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:27:55,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-09 12:27:55,755 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash -299474295, now seen corresponding path program 1 times [2020-10-09 12:27:55,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:55,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838379699] [2020-10-09 12:27:55,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:55,911 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-09 12:27:55,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838379699] [2020-10-09 12:27:55,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:55,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:27:55,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690262800] [2020-10-09 12:27:55,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:27:55,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:55,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:27:55,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:27:55,915 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2020-10-09 12:27:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:55,928 INFO L93 Difference]: Finished difference Result 602 states and 1842 transitions. [2020-10-09 12:27:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:27:55,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-09 12:27:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:55,936 INFO L225 Difference]: With dead ends: 602 [2020-10-09 12:27:55,936 INFO L226 Difference]: Without dead ends: 602 [2020-10-09 12:27:55,937 INFO L673 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-09 12:27:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2020-10-09 12:27:55,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2020-10-09 12:27:55,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2020-10-09 12:27:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1842 transitions. [2020-10-09 12:27:55,969 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1842 transitions. Word has length 9 [2020-10-09 12:27:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:55,969 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 1842 transitions. [2020-10-09 12:27:55,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:27:55,970 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1842 transitions. [2020-10-09 12:27:55,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-09 12:27:55,972 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:55,972 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:27:55,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-09 12:27:55,973 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:55,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:55,973 INFO L82 PathProgramCache]: Analyzing trace with hash -448103436, now seen corresponding path program 1 times [2020-10-09 12:27:55,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:55,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333333041] [2020-10-09 12:27:55,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:56,016 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-09 12:27:56,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333333041] [2020-10-09 12:27:56,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:56,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:27:56,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750445403] [2020-10-09 12:27:56,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:27:56,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:56,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:27:56,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:27:56,019 INFO L87 Difference]: Start difference. First operand 602 states and 1842 transitions. Second operand 3 states. [2020-10-09 12:27:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:56,031 INFO L93 Difference]: Finished difference Result 566 states and 1716 transitions. [2020-10-09 12:27:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:27:56,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-09 12:27:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:56,039 INFO L225 Difference]: With dead ends: 566 [2020-10-09 12:27:56,039 INFO L226 Difference]: Without dead ends: 566 [2020-10-09 12:27:56,039 INFO L673 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-09 12:27:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2020-10-09 12:27:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2020-10-09 12:27:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2020-10-09 12:27:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1716 transitions. [2020-10-09 12:27:56,068 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 1716 transitions. Word has length 11 [2020-10-09 12:27:56,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:56,068 INFO L481 AbstractCegarLoop]: Abstraction has 566 states and 1716 transitions. [2020-10-09 12:27:56,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:27:56,069 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 1716 transitions. [2020-10-09 12:27:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-09 12:27:56,072 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:56,072 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:27:56,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-09 12:27:56,072 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:56,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:56,073 INFO L82 PathProgramCache]: Analyzing trace with hash -507490775, now seen corresponding path program 1 times [2020-10-09 12:27:56,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:56,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633657609] [2020-10-09 12:27:56,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:56,113 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-09 12:27:56,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633657609] [2020-10-09 12:27:56,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:56,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-09 12:27:56,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059107283] [2020-10-09 12:27:56,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-09 12:27:56,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:56,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-09 12:27:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-09 12:27:56,119 INFO L87 Difference]: Start difference. First operand 566 states and 1716 transitions. Second operand 3 states. [2020-10-09 12:27:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:56,137 INFO L93 Difference]: Finished difference Result 548 states and 1656 transitions. [2020-10-09 12:27:56,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 12:27:56,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-09 12:27:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:56,144 INFO L225 Difference]: With dead ends: 548 [2020-10-09 12:27:56,144 INFO L226 Difference]: Without dead ends: 548 [2020-10-09 12:27:56,145 INFO L673 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-09 12:27:56,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-09 12:27:56,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-09 12:27:56,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-09 12:27:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1656 transitions. [2020-10-09 12:27:56,174 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1656 transitions. Word has length 13 [2020-10-09 12:27:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:56,174 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1656 transitions. [2020-10-09 12:27:56,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-09 12:27:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1656 transitions. [2020-10-09 12:27:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-09 12:27:56,177 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:56,177 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:27:56,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-09 12:27:56,178 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1900332105, now seen corresponding path program 1 times [2020-10-09 12:27:56,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:56,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882229865] [2020-10-09 12:27:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:56,312 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-09 12:27:56,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882229865] [2020-10-09 12:27:56,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:56,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:27:56,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152674330] [2020-10-09 12:27:56,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:27:56,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:56,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:27:56,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:27:56,316 INFO L87 Difference]: Start difference. First operand 548 states and 1656 transitions. Second operand 4 states. [2020-10-09 12:27:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:56,377 INFO L93 Difference]: Finished difference Result 526 states and 1413 transitions. [2020-10-09 12:27:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-09 12:27:56,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-09 12:27:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:56,382 INFO L225 Difference]: With dead ends: 526 [2020-10-09 12:27:56,382 INFO L226 Difference]: Without dead ends: 376 [2020-10-09 12:27:56,383 INFO L673 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-09 12:27:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2020-10-09 12:27:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2020-10-09 12:27:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-10-09 12:27:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 968 transitions. [2020-10-09 12:27:56,398 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 968 transitions. Word has length 15 [2020-10-09 12:27:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:56,398 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 968 transitions. [2020-10-09 12:27:56,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:27:56,398 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 968 transitions. [2020-10-09 12:27:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-09 12:27:56,400 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:56,400 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:27:56,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-09 12:27:56,400 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash 525968040, now seen corresponding path program 1 times [2020-10-09 12:27:56,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:56,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314133679] [2020-10-09 12:27:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:56,499 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-09 12:27:56,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314133679] [2020-10-09 12:27:56,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:56,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-09 12:27:56,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855127902] [2020-10-09 12:27:56,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-09 12:27:56,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:56,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-09 12:27:56,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-09 12:27:56,502 INFO L87 Difference]: Start difference. First operand 376 states and 968 transitions. Second operand 5 states. [2020-10-09 12:27:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:56,552 INFO L93 Difference]: Finished difference Result 318 states and 765 transitions. [2020-10-09 12:27:56,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-09 12:27:56,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-09 12:27:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:56,554 INFO L225 Difference]: With dead ends: 318 [2020-10-09 12:27:56,554 INFO L226 Difference]: Without dead ends: 248 [2020-10-09 12:27:56,555 INFO L673 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-09 12:27:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-10-09 12:27:56,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2020-10-09 12:27:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-10-09 12:27:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 584 transitions. [2020-10-09 12:27:56,562 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 584 transitions. Word has length 17 [2020-10-09 12:27:56,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:56,563 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 584 transitions. [2020-10-09 12:27:56,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-09 12:27:56,563 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 584 transitions. [2020-10-09 12:27:56,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-09 12:27:56,564 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:56,564 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 12:27:56,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-09 12:27:56,565 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:56,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:56,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1751165511, now seen corresponding path program 1 times [2020-10-09 12:27:56,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:56,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580338309] [2020-10-09 12:27:56,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:56,718 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-09 12:27:56,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580338309] [2020-10-09 12:27:56,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:56,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:27:56,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801685492] [2020-10-09 12:27:56,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-09 12:27:56,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:56,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-09 12:27:56,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-09 12:27:56,721 INFO L87 Difference]: Start difference. First operand 248 states and 584 transitions. Second operand 6 states. [2020-10-09 12:27:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:56,778 INFO L93 Difference]: Finished difference Result 229 states and 544 transitions. [2020-10-09 12:27:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-09 12:27:56,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-09 12:27:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:56,780 INFO L225 Difference]: With dead ends: 229 [2020-10-09 12:27:56,781 INFO L226 Difference]: Without dead ends: 215 [2020-10-09 12:27:56,781 INFO L673 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-09 12:27:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-10-09 12:27:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2020-10-09 12:27:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-09 12:27:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions. [2020-10-09 12:27:56,788 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 19 [2020-10-09 12:27:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:56,789 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 518 transitions. [2020-10-09 12:27:56,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-09 12:27:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions. [2020-10-09 12:27:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 12:27:56,790 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:56,790 INFO L421 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] [2020-10-09 12:27:56,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-09 12:27:56,790 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash 567042970, now seen corresponding path program 1 times [2020-10-09 12:27:56,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:56,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785721100] [2020-10-09 12:27:56,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:56,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:56,859 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-09 12:27:56,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785721100] [2020-10-09 12:27:56,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:56,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:27:56,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129503962] [2020-10-09 12:27:56,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:27:56,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:27:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:27:56,861 INFO L87 Difference]: Start difference. First operand 215 states and 518 transitions. Second operand 4 states. [2020-10-09 12:27:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:56,878 INFO L93 Difference]: Finished difference Result 277 states and 653 transitions. [2020-10-09 12:27:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 12:27:56,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-09 12:27:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:56,880 INFO L225 Difference]: With dead ends: 277 [2020-10-09 12:27:56,880 INFO L226 Difference]: Without dead ends: 107 [2020-10-09 12:27:56,880 INFO L673 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-09 12:27:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-09 12:27:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-09 12:27:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-09 12:27:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 222 transitions. [2020-10-09 12:27:56,884 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 222 transitions. Word has length 22 [2020-10-09 12:27:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:56,884 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 222 transitions. [2020-10-09 12:27:56,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:27:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 222 transitions. [2020-10-09 12:27:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 12:27:56,885 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:56,885 INFO L421 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] [2020-10-09 12:27:56,886 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-09 12:27:56,886 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash -478950482, now seen corresponding path program 2 times [2020-10-09 12:27:56,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:56,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218011755] [2020-10-09 12:27:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:56,948 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-09 12:27:56,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218011755] [2020-10-09 12:27:56,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:56,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-09 12:27:56,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468239581] [2020-10-09 12:27:56,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 12:27:56,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 12:27:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-09 12:27:56,950 INFO L87 Difference]: Start difference. First operand 107 states and 222 transitions. Second operand 4 states. [2020-10-09 12:27:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:56,967 INFO L93 Difference]: Finished difference Result 133 states and 270 transitions. [2020-10-09 12:27:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-09 12:27:56,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-09 12:27:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:56,968 INFO L225 Difference]: With dead ends: 133 [2020-10-09 12:27:56,969 INFO L226 Difference]: Without dead ends: 51 [2020-10-09 12:27:56,969 INFO L673 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-09 12:27:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-09 12:27:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-09 12:27:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-09 12:27:56,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 86 transitions. [2020-10-09 12:27:56,971 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 86 transitions. Word has length 22 [2020-10-09 12:27:56,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:56,971 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 86 transitions. [2020-10-09 12:27:56,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 12:27:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 86 transitions. [2020-10-09 12:27:56,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 12:27:56,972 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:56,972 INFO L421 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] [2020-10-09 12:27:56,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-09 12:27:56,973 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:56,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:56,973 INFO L82 PathProgramCache]: Analyzing trace with hash -628070226, now seen corresponding path program 3 times [2020-10-09 12:27:56,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:56,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473973385] [2020-10-09 12:27:56,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 12:27:57,338 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-09 12:27:57,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473973385] [2020-10-09 12:27:57,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-09 12:27:57,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-09 12:27:57,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159155943] [2020-10-09 12:27:57,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-09 12:27:57,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-09 12:27:57,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-09 12:27:57,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-09 12:27:57,341 INFO L87 Difference]: Start difference. First operand 51 states and 86 transitions. Second operand 7 states. [2020-10-09 12:27:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-09 12:27:57,553 INFO L93 Difference]: Finished difference Result 61 states and 100 transitions. [2020-10-09 12:27:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-09 12:27:57,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2020-10-09 12:27:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-09 12:27:57,554 INFO L225 Difference]: With dead ends: 61 [2020-10-09 12:27:57,554 INFO L226 Difference]: Without dead ends: 33 [2020-10-09 12:27:57,555 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-09 12:27:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-10-09 12:27:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-10-09 12:27:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-10-09 12:27:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-10-09 12:27:57,557 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 22 [2020-10-09 12:27:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-09 12:27:57,557 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-10-09 12:27:57,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-09 12:27:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-10-09 12:27:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-09 12:27:57,558 INFO L413 BasicCegarLoop]: Found error trace [2020-10-09 12:27:57,558 INFO L421 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] [2020-10-09 12:27:57,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-09 12:27:57,558 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 12:27:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 12:27:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash 515881070, now seen corresponding path program 4 times [2020-10-09 12:27:57,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-09 12:27:57,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94263617] [2020-10-09 12:27:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-09 12:27:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:27:57,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:27:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 12:27:57,722 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 12:27:57,779 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-09 12:27:57,780 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 12:27:57,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-09 12:27:57,782 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-09 12:27:57,801 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1172] [1172] L856-->L863: Formula: (let ((.cse7 (= (mod ~z$r_buff1_thd0~0_In1163290409 256) 0)) (.cse6 (= (mod ~z$w_buff1_used~0_In1163290409 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In1163290409 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In1163290409 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_Out1163290409 ~z$r_buff0_thd0~0_In1163290409) (= ~z$r_buff1_thd0~0_Out1163290409 ~z$r_buff1_thd0~0_In1163290409) (or (and (= ~z~0_Out1163290409 ~z$w_buff0~0_In1163290409) .cse0 .cse1) (and (or (and .cse2 (= ~z~0_In1163290409 ~z~0_Out1163290409)) (and .cse3 .cse4 (= ~z$w_buff1~0_In1163290409 ~z~0_Out1163290409))) .cse5)) (or (and (= ~z$w_buff0_used~0_Out1163290409 0) .cse0 .cse1) (and (= ~z$w_buff0_used~0_In1163290409 ~z$w_buff0_used~0_Out1163290409) .cse5)) (or (and .cse3 (= ~z$w_buff1_used~0_Out1163290409 0) .cse4) (and .cse2 (= ~z$w_buff1_used~0_Out1163290409 ~z$w_buff1_used~0_In1163290409))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1163290409 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1163290409|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1163290409 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1163290409|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1163290409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1163290409, ~z$w_buff0~0=~z$w_buff0~0_In1163290409, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1163290409, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1163290409, ~z$w_buff1~0=~z$w_buff1~0_In1163290409, ~z~0=~z~0_In1163290409} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1163290409, ~z$w_buff0~0=~z$w_buff0~0_In1163290409, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1163290409, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1163290409|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1163290409|, ~z$w_buff1~0=~z$w_buff1~0_In1163290409, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1163290409|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1163290409|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1163290409|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1163290409, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1163290409|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1163290409|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1163290409, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1163290409, ~z~0=~z~0_Out1163290409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2020-10-09 12:27:57,814 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-09 12:27:57,814 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,816 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-09 12:27:57,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,816 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-09 12:27:57,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,817 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-09 12:27:57,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,817 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-09 12:27:57,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,818 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-09 12:27:57,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,818 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-09 12:27:57,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,818 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-09 12:27:57,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,819 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-09 12:27:57,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,819 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-09 12:27:57,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,820 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-09 12:27:57,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,820 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-09 12:27:57,820 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,820 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-09 12:27:57,821 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,821 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-09 12:27:57,821 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,822 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-09 12:27:57,823 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,827 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-09 12:27:57,827 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,827 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-09 12:27:57,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,828 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-09 12:27:57,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,828 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-09 12:27:57,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,828 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-09 12:27:57,828 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,829 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-09 12:27:57,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,829 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-09 12:27:57,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,829 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-09 12:27:57,829 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,829 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-09 12:27:57,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,830 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-09 12:27:57,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,830 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-09 12:27:57,830 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,831 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-09 12:27:57,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,831 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-09 12:27:57,831 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,831 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-09 12:27:57,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,832 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-09 12:27:57,832 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 12:27:57,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 12:27:57 BasicIcfg [2020-10-09 12:27:57,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 12:27:57,908 INFO L168 Benchmark]: Toolchain (without parser) took 12108.35 ms. Allocated memory was 249.0 MB in the beginning and 528.0 MB in the end (delta: 278.9 MB). Free memory was 203.5 MB in the beginning and 169.6 MB in the end (delta: 33.9 MB). Peak memory consumption was 312.8 MB. Max. memory is 14.2 GB. [2020-10-09 12:27:57,909 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-09 12:27:57,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.48 ms. Allocated memory was 249.0 MB in the beginning and 307.2 MB in the end (delta: 58.2 MB). Free memory was 203.5 MB in the beginning and 253.0 MB in the end (delta: -49.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:27:57,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.95 ms. Allocated memory is still 307.2 MB. Free memory was 253.0 MB in the beginning and 250.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. [2020-10-09 12:27:57,911 INFO L168 Benchmark]: Boogie Preprocessor took 45.45 ms. Allocated memory is still 307.2 MB. Free memory was 250.3 MB in the beginning and 247.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 12:27:57,912 INFO L168 Benchmark]: RCFGBuilder took 2507.69 ms. Allocated memory was 307.2 MB in the beginning and 369.1 MB in the end (delta: 61.9 MB). Free memory was 247.8 MB in the beginning and 321.0 MB in the end (delta: -73.2 MB). Peak memory consumption was 145.4 MB. Max. memory is 14.2 GB. [2020-10-09 12:27:57,913 INFO L168 Benchmark]: TraceAbstraction took 8680.25 ms. Allocated memory was 369.1 MB in the beginning and 528.0 MB in the end (delta: 158.9 MB). Free memory was 317.3 MB in the beginning and 169.6 MB in the end (delta: 147.7 MB). Peak memory consumption was 306.6 MB. Max. memory is 14.2 GB. [2020-10-09 12:27:57,917 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 792.48 ms. Allocated memory was 249.0 MB in the beginning and 307.2 MB in the end (delta: 58.2 MB). Free memory was 203.5 MB in the beginning and 253.0 MB in the end (delta: -49.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 75.95 ms. Allocated memory is still 307.2 MB. Free memory was 253.0 MB in the beginning and 250.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 45.45 ms. Allocated memory is still 307.2 MB. Free memory was 250.3 MB in the beginning and 247.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2507.69 ms. Allocated memory was 307.2 MB in the beginning and 369.1 MB in the end (delta: 61.9 MB). Free memory was 247.8 MB in the beginning and 321.0 MB in the end (delta: -73.2 MB). Peak memory consumption was 145.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8680.25 ms. Allocated memory was 369.1 MB in the beginning and 528.0 MB in the end (delta: 158.9 MB). Free memory was 317.3 MB in the beginning and 169.6 MB in the end (delta: 147.7 MB). Peak memory consumption was 306.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1334 VarBasedMoverChecksPositive, 89 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.2s, 108 PlacesBefore, 37 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1814 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, 5577 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p0_EBX = 0; [L704] 0 int __unbuffered_p1_EAX = 0; [L706] 0 int __unbuffered_p1_EBX = 0; [L708] 0 int __unbuffered_p2_EAX = 0; [L710] 0 int __unbuffered_p2_EBX = 0; [L712] 0 int a = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L720] 0 int z = 0; [L721] 0 _Bool z$flush_delayed; [L722] 0 int z$mem_tmp; [L723] 0 _Bool z$r_buff0_thd0; [L724] 0 _Bool z$r_buff0_thd1; [L725] 0 _Bool z$r_buff0_thd2; [L726] 0 _Bool z$r_buff0_thd3; [L727] 0 _Bool z$r_buff1_thd0; [L728] 0 _Bool z$r_buff1_thd1; [L729] 0 _Bool z$r_buff1_thd2; [L730] 0 _Bool z$r_buff1_thd3; [L731] 0 _Bool z$read_delayed; [L732] 0 int *z$read_delayed_var; [L733] 0 int z$w_buff0; [L734] 0 _Bool z$w_buff0_used; [L735] 0 int z$w_buff1; [L736] 0 _Bool z$w_buff1_used; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L847] 0 pthread_t t41; [L848] FCALL, FORK 0 pthread_create(&t41, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t42; [L850] FCALL, FORK 0 pthread_create(&t42, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] 0 pthread_t t43; [L852] FCALL, FORK 0 pthread_create(&t43, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 z$w_buff1 = z$w_buff0 [L795] 3 z$w_buff0 = 1 [L796] 3 z$w_buff1_used = z$w_buff0_used [L797] 3 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L799] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L800] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L801] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L802] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L803] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 z$flush_delayed = weak$$choice2 [L809] 3 z$mem_tmp = z [L810] 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) [L810] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L810] 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) [L810] 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) [L811] 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)) [L811] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 3 __unbuffered_p2_EAX = z [L818] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L818] 3 z = z$flush_delayed ? z$mem_tmp : z [L819] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 a = 1 [L745] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 z$flush_delayed = weak$$choice2 [L772] 2 z$mem_tmp = z [L773] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L773] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L774] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L774] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L775] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L775] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L776] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L778] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L778] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L778] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L779] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L779] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = z [L781] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L781] 2 z = z$flush_delayed ? z$mem_tmp : z [L782] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L825] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L825] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L826] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L826] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L827] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L827] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L828] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L828] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L829] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L829] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L865] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=255, x=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 272 SDtfs, 211 SDslu, 405 SDs, 0 SdLazy, 139 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 15825 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...