/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix007_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 05:14:25,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 05:14:25,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 05:14:25,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 05:14:25,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 05:14:25,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 05:14:25,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 05:14:25,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 05:14:25,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 05:14:25,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 05:14:25,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 05:14:25,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 05:14:25,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 05:14:25,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 05:14:25,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 05:14:25,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 05:14:25,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 05:14:25,598 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 05:14:25,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 05:14:25,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 05:14:25,604 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 05:14:25,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 05:14:25,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 05:14:25,609 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 05:14:25,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 05:14:25,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 05:14:25,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 05:14:25,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 05:14:25,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 05:14:25,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 05:14:25,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 05:14:25,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 05:14:25,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 05:14:25,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 05:14:25,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 05:14:25,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 05:14:25,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 05:14:25,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 05:14:25,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 05:14:25,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 05:14:25,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 05:14:25,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2020-11-12 05:14:25,693 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 05:14:25,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 05:14:25,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 05:14:25,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 05:14:25,698 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 05:14:25,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 05:14:25,699 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 05:14:25,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 05:14:25,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 05:14:25,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 05:14:25,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 05:14:25,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 05:14:25,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 05:14:25,701 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 05:14:25,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 05:14:25,701 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 05:14:25,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 05:14:25,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 05:14:25,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 05:14:25,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 05:14:25,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 05:14:25,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 05:14:25,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 05:14:25,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 05:14:25,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 05:14:25,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 05:14:25,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 05:14:25,704 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-12 05:14:25,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 05:14:25,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-12 05:14:25,705 INFO L138 SettingsManager]: * Sleep set reduction in concurrent analysis=DELAY_SET WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-12 05:14:26,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 05:14:26,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 05:14:26,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 05:14:26,190 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 05:14:26,192 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 05:14:26,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_rmo.oepc.i [2020-11-12 05:14:26,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da8ef787/707f99678d36477f99ff3a4cd29f6f2b/FLAG59fe34932 [2020-11-12 05:14:27,067 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 05:14:27,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_rmo.oepc.i [2020-11-12 05:14:27,091 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da8ef787/707f99678d36477f99ff3a4cd29f6f2b/FLAG59fe34932 [2020-11-12 05:14:27,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da8ef787/707f99678d36477f99ff3a4cd29f6f2b [2020-11-12 05:14:27,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 05:14:27,311 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 05:14:27,313 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 05:14:27,313 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 05:14:27,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 05:14:27,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:14:27" (1/1) ... [2020-11-12 05:14:27,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9894fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:27, skipping insertion in model container [2020-11-12 05:14:27,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:14:27" (1/1) ... [2020-11-12 05:14:27,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 05:14:27,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 05:14:27,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 05:14:27,928 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 05:14:28,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 05:14:28,139 INFO L208 MainTranslator]: Completed translation [2020-11-12 05:14:28,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28 WrapperNode [2020-11-12 05:14:28,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 05:14:28,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 05:14:28,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 05:14:28,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 05:14:28,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 05:14:28,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 05:14:28,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 05:14:28,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 05:14:28,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (1/1) ... [2020-11-12 05:14:28,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 05:14:28,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 05:14:28,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 05:14:28,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 05:14:28,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (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-11-12 05:14:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 05:14:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-12 05:14:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 05:14:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 05:14:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-12 05:14:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-12 05:14:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-12 05:14:28,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-12 05:14:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-12 05:14:28,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-12 05:14:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-12 05:14:28,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-12 05:14:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 05:14:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-12 05:14:28,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 05:14:28,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 05:14:28,452 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 05:14:31,334 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 05:14:31,335 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-12 05:14:31,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:14:31 BoogieIcfgContainer [2020-11-12 05:14:31,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 05:14:31,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 05:14:31,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 05:14:31,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 05:14:31,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:14:27" (1/3) ... [2020-11-12 05:14:31,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e31a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:14:31, skipping insertion in model container [2020-11-12 05:14:31,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:14:28" (2/3) ... [2020-11-12 05:14:31,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e31a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:14:31, skipping insertion in model container [2020-11-12 05:14:31,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:14:31" (3/3) ... [2020-11-12 05:14:31,347 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_rmo.oepc.i [2020-11-12 05:14:31,364 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 05:14:31,365 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 05:14:31,369 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-12 05:14:31,370 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 05:14:31,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,417 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,417 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,419 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,419 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,420 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,421 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,432 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,432 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,433 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,433 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,433 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,437 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,439 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,442 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,443 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,444 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,445 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,447 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,448 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,449 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,474 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,474 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,474 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,475 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,476 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,479 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,480 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,481 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,483 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,483 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:14:31,485 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 05:14:31,499 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-12 05:14:31,523 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 05:14:31,523 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 05:14:31,523 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 05:14:31,523 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 05:14:31,523 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 05:14:31,524 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 05:14:31,524 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 05:14:31,524 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 05:14:31,538 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 124 transitions, 268 flow [2020-11-12 05:15:35,996 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 183752 states, 183748 states have (on average 4.588550623680257) internal successors, (843137), 183751 states have internal predecessors, (843137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:36,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-12 05:15:36,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:36,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-12 05:15:36,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:36,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:36,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:15:36,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:15:36,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:36,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:36,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:36,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:36,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:36,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:36,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:36,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:36,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:36,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:36,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:36,831 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-11-12 05:15:36,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:36,834 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-11-12 05:15:36,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:36,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:36,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:36,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:36,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:36,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:36,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:36,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:36,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:36,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:36,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:36,903 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-11-12 05:15:36,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:36,907 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-11-12 05:15:36,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:36,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:36,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:15:36,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:15:36,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:37,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:37,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:37,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:37,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:37,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:37,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:37,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:37,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:37,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:37,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:37,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:37,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:37,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:37,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:37,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:37,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:37,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:37,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:37,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:37,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:37,376 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-11-12 05:15:37,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:37,377 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-11-12 05:15:37,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:37,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:37,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:15:37,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:15:37,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:37,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:37,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:15:37,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:15:37,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:37,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:37,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:37,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:37,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:37,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:37,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:37,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:37,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:37,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:37,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:37,930 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-11-12 05:15:37,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:37,940 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-11-12 05:15:37,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:38,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:38,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:38,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:38,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:38,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:38,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:38,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:38,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:38,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:38,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:38,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:38,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:38,923 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-11-12 05:15:38,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:38,926 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-11-12 05:15:38,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:38,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:38,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:15:38,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:15:38,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:39,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:39,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:15:39,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:15:39,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:39,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:39,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:39,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:39,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:39,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:39,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:39,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:39,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:39,094 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-11-12 05:15:39,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:39,095 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-11-12 05:15:39,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:39,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,879 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,882 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:39,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:39,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:39,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:39,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:40,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:40,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:40,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:40,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:40,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:40,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:40,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,880 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:40,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:40,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:40,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:40,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:40,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:40,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,895 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-11-12 05:15:40,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,896 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-11-12 05:15:40,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:40,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:40,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:15:40,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:15:40,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:41,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:41,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:15:41,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 05:15:41,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:41,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:41,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:41,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:15:41,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:41,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:15:41,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:15:41,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:15:41,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:41,282 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-11-12 05:15:41,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:41,283 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-11-12 05:15:41,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:15:41,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:41,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:15:41,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:41,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:15:41,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:15:43,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:43,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:43,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:43,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:43,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:43,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:43,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:15:43,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:15:44,976 WARN L455 BasicCegarLoop]: Sleep Set Reduction Time: 8975ms [2020-11-12 05:15:45,185 WARN L456 BasicCegarLoop]: Sleep set: input automaton has 183752 states, 183748 states have (on average 4.588550623680257) internal successors, (843137), 183751 states have internal predecessors, (843137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:45,521 WARN L457 BasicCegarLoop]: Sleep set: output automaton has 183752 states, 171362 states have (on average 1.5961298304174787) internal successors, (273516), 183751 states have internal predecessors, (273516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 183752 states, 171362 states have (on average 1.5961298304174787) internal successors, (273516), 183751 states have internal predecessors, (273516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-12 05:15:45,729 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:15:45,730 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:15:45,731 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:15:45,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:15:45,738 INFO L82 PathProgramCache]: Analyzing trace with hash -624824306, now seen corresponding path program 1 times [2020-11-12 05:15:45,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:15:45,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344074355] [2020-11-12 05:15:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:15:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:15:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:15:46,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344074355] [2020-11-12 05:15:46,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:15:46,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 05:15:46,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49833150] [2020-11-12 05:15:46,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 05:15:46,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:15:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 05:15:46,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 05:15:46,226 INFO L87 Difference]: Start difference. First operand has 183752 states, 171362 states have (on average 1.5961298304174787) internal successors, (273516), 183751 states have internal predecessors, (273516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:15:47,706 INFO L93 Difference]: Finished difference Result 152972 states and 217499 transitions. [2020-11-12 05:15:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 05:15:47,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2020-11-12 05:15:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:15:48,264 INFO L225 Difference]: With dead ends: 152972 [2020-11-12 05:15:48,264 INFO L226 Difference]: Without dead ends: 80439 [2020-11-12 05:15:48,267 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 05:15:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80439 states. [2020-11-12 05:15:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80439 to 80439. [2020-11-12 05:15:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80439 states, 75255 states have (on average 1.8881403229021327) internal successors, (142092), 80438 states have internal predecessors, (142092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:51,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80439 states to 80439 states and 142092 transitions. [2020-11-12 05:15:51,800 INFO L78 Accepts]: Start accepts. Automaton has 80439 states and 142092 transitions. Word has length 46 [2020-11-12 05:15:51,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:15:51,802 INFO L481 AbstractCegarLoop]: Abstraction has 80439 states and 142092 transitions. [2020-11-12 05:15:51,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 80439 states and 142092 transitions. [2020-11-12 05:15:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-12 05:15:51,858 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:15:51,859 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:15:51,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 05:15:51,859 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:15:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:15:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1630464496, now seen corresponding path program 1 times [2020-11-12 05:15:51,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:15:51,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429601362] [2020-11-12 05:15:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:15:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:15:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:15:52,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429601362] [2020-11-12 05:15:52,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:15:52,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:15:52,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237338451] [2020-11-12 05:15:52,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:15:52,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:15:52,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:15:52,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:15:52,177 INFO L87 Difference]: Start difference. First operand 80439 states and 142092 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:15:53,303 INFO L93 Difference]: Finished difference Result 87351 states and 166600 transitions. [2020-11-12 05:15:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:15:53,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2020-11-12 05:15:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:15:53,581 INFO L225 Difference]: With dead ends: 87351 [2020-11-12 05:15:53,581 INFO L226 Difference]: Without dead ends: 60411 [2020-11-12 05:15:53,582 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:15:54,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60411 states. [2020-11-12 05:15:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60411 to 60411. [2020-11-12 05:15:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60411 states, 56955 states have (on average 1.9157229391624968) internal successors, (109110), 60410 states have internal predecessors, (109110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60411 states to 60411 states and 109110 transitions. [2020-11-12 05:15:56,195 INFO L78 Accepts]: Start accepts. Automaton has 60411 states and 109110 transitions. Word has length 71 [2020-11-12 05:15:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:15:56,196 INFO L481 AbstractCegarLoop]: Abstraction has 60411 states and 109110 transitions. [2020-11-12 05:15:56,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 60411 states and 109110 transitions. [2020-11-12 05:15:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-12 05:15:56,248 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:15:56,248 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:15:56,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 05:15:56,248 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:15:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:15:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash -883669002, now seen corresponding path program 1 times [2020-11-12 05:15:56,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:15:56,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323621960] [2020-11-12 05:15:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:15:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:15:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:15:56,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323621960] [2020-11-12 05:15:56,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:15:56,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:15:56,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441487925] [2020-11-12 05:15:56,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:15:56,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:15:56,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:15:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:15:56,462 INFO L87 Difference]: Start difference. First operand 60411 states and 109110 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:15:56,906 INFO L93 Difference]: Finished difference Result 65019 states and 125790 transitions. [2020-11-12 05:15:56,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:15:56,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2020-11-12 05:15:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:15:57,026 INFO L225 Difference]: With dead ends: 65019 [2020-11-12 05:15:57,026 INFO L226 Difference]: Without dead ends: 47223 [2020-11-12 05:15:57,027 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:15:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47223 states. [2020-11-12 05:15:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47223 to 47223. [2020-11-12 05:15:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47223 states, 44919 states have (on average 1.9262004942229347) internal successors, (86523), 47222 states have internal predecessors, (86523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47223 states to 47223 states and 86523 transitions. [2020-11-12 05:15:58,597 INFO L78 Accepts]: Start accepts. Automaton has 47223 states and 86523 transitions. Word has length 74 [2020-11-12 05:15:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:15:58,597 INFO L481 AbstractCegarLoop]: Abstraction has 47223 states and 86523 transitions. [2020-11-12 05:15:58,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 47223 states and 86523 transitions. [2020-11-12 05:15:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-12 05:15:58,639 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:15:58,639 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:15:58,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 05:15:58,640 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:15:58,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:15:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1584034046, now seen corresponding path program 1 times [2020-11-12 05:15:58,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:15:58,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769702986] [2020-11-12 05:15:58,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:15:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:15:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:15:58,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769702986] [2020-11-12 05:15:58,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:15:58,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:15:58,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353218987] [2020-11-12 05:15:58,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:15:58,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:15:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:15:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:15:58,817 INFO L87 Difference]: Start difference. First operand 47223 states and 86523 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:15:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:15:59,562 INFO L93 Difference]: Finished difference Result 57241 states and 101143 transitions. [2020-11-12 05:15:59,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:15:59,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2020-11-12 05:15:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:15:59,683 INFO L225 Difference]: With dead ends: 57241 [2020-11-12 05:15:59,683 INFO L226 Difference]: Without dead ends: 42537 [2020-11-12 05:15:59,684 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:16:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42537 states. [2020-11-12 05:16:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42537 to 42537. [2020-11-12 05:16:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42537 states, 40458 states have (on average 1.9289633694201394) internal successors, (78042), 42536 states have internal predecessors, (78042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42537 states to 42537 states and 78042 transitions. [2020-11-12 05:16:00,926 INFO L78 Accepts]: Start accepts. Automaton has 42537 states and 78042 transitions. Word has length 77 [2020-11-12 05:16:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:16:00,933 INFO L481 AbstractCegarLoop]: Abstraction has 42537 states and 78042 transitions. [2020-11-12 05:16:00,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 42537 states and 78042 transitions. [2020-11-12 05:16:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-12 05:16:00,988 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:16:00,996 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:16:00,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 05:16:00,997 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:16:00,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:16:00,997 INFO L82 PathProgramCache]: Analyzing trace with hash -620181855, now seen corresponding path program 1 times [2020-11-12 05:16:00,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:16:00,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003850950] [2020-11-12 05:16:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:16:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:16:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:16:01,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003850950] [2020-11-12 05:16:01,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:16:01,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:16:01,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946391434] [2020-11-12 05:16:01,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:16:01,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:16:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:16:01,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:16:01,237 INFO L87 Difference]: Start difference. First operand 42537 states and 78042 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:16:01,560 INFO L93 Difference]: Finished difference Result 41781 states and 74214 transitions. [2020-11-12 05:16:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 05:16:01,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2020-11-12 05:16:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:16:01,598 INFO L225 Difference]: With dead ends: 41781 [2020-11-12 05:16:01,598 INFO L226 Difference]: Without dead ends: 28671 [2020-11-12 05:16:01,599 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-12 05:16:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28671 states. [2020-11-12 05:16:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28671 to 28671. [2020-11-12 05:16:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28671 states, 27312 states have (on average 1.913993848857645) internal successors, (52275), 28670 states have internal predecessors, (52275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28671 states to 28671 states and 52275 transitions. [2020-11-12 05:16:02,041 INFO L78 Accepts]: Start accepts. Automaton has 28671 states and 52275 transitions. Word has length 80 [2020-11-12 05:16:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:16:02,042 INFO L481 AbstractCegarLoop]: Abstraction has 28671 states and 52275 transitions. [2020-11-12 05:16:02,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 28671 states and 52275 transitions. [2020-11-12 05:16:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-12 05:16:02,064 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:16:02,064 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:16:02,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 05:16:02,065 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:16:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:16:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1609539370, now seen corresponding path program 1 times [2020-11-12 05:16:02,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:16:02,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076539438] [2020-11-12 05:16:02,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:16:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:16:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:16:02,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076539438] [2020-11-12 05:16:02,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:16:02,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 05:16:02,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427289137] [2020-11-12 05:16:02,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 05:16:02,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:16:02,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 05:16:02,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 05:16:02,737 INFO L87 Difference]: Start difference. First operand 28671 states and 52275 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:16:03,054 INFO L93 Difference]: Finished difference Result 21831 states and 38676 transitions. [2020-11-12 05:16:03,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 05:16:03,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2020-11-12 05:16:03,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:16:03,074 INFO L225 Difference]: With dead ends: 21831 [2020-11-12 05:16:03,074 INFO L226 Difference]: Without dead ends: 13376 [2020-11-12 05:16:03,075 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-11-12 05:16:03,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13376 states. [2020-11-12 05:16:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13376 to 13376. [2020-11-12 05:16:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13376 states, 12863 states have (on average 1.8259348519008007) internal successors, (23487), 13375 states have internal predecessors, (23487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13376 states to 13376 states and 23487 transitions. [2020-11-12 05:16:03,299 INFO L78 Accepts]: Start accepts. Automaton has 13376 states and 23487 transitions. Word has length 83 [2020-11-12 05:16:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:16:03,299 INFO L481 AbstractCegarLoop]: Abstraction has 13376 states and 23487 transitions. [2020-11-12 05:16:03,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13376 states and 23487 transitions. [2020-11-12 05:16:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-12 05:16:03,313 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:16:03,313 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:16:03,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 05:16:03,313 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:16:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:16:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1643094546, now seen corresponding path program 1 times [2020-11-12 05:16:03,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:16:03,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522325314] [2020-11-12 05:16:03,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:16:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:16:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:16:03,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522325314] [2020-11-12 05:16:03,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:16:03,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 05:16:03,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153209776] [2020-11-12 05:16:03,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 05:16:03,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:16:03,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 05:16:03,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-12 05:16:03,758 INFO L87 Difference]: Start difference. First operand 13376 states and 23487 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:16:04,339 INFO L93 Difference]: Finished difference Result 29017 states and 54739 transitions. [2020-11-12 05:16:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 05:16:04,340 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2020-11-12 05:16:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:16:04,365 INFO L225 Difference]: With dead ends: 29017 [2020-11-12 05:16:04,365 INFO L226 Difference]: Without dead ends: 20061 [2020-11-12 05:16:04,366 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-11-12 05:16:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20061 states. [2020-11-12 05:16:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20061 to 14074. [2020-11-12 05:16:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14074 states, 13561 states have (on average 1.8051766093945874) internal successors, (24480), 14073 states have internal predecessors, (24480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14074 states to 14074 states and 24480 transitions. [2020-11-12 05:16:04,964 INFO L78 Accepts]: Start accepts. Automaton has 14074 states and 24480 transitions. Word has length 88 [2020-11-12 05:16:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:16:04,964 INFO L481 AbstractCegarLoop]: Abstraction has 14074 states and 24480 transitions. [2020-11-12 05:16:04,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 14074 states and 24480 transitions. [2020-11-12 05:16:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-11-12 05:16:04,983 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:16:04,983 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:16:04,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 05:16:04,984 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:16:04,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:16:04,984 INFO L82 PathProgramCache]: Analyzing trace with hash -647239038, now seen corresponding path program 2 times [2020-11-12 05:16:04,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:16:04,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091794755] [2020-11-12 05:16:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:16:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:16:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:16:05,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091794755] [2020-11-12 05:16:05,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:16:05,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 05:16:05,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207144123] [2020-11-12 05:16:05,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 05:16:05,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:16:05,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 05:16:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 05:16:05,259 INFO L87 Difference]: Start difference. First operand 14074 states and 24480 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:05,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:16:05,545 INFO L93 Difference]: Finished difference Result 9862 states and 16569 transitions. [2020-11-12 05:16:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 05:16:05,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2020-11-12 05:16:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:16:05,554 INFO L225 Difference]: With dead ends: 9862 [2020-11-12 05:16:05,554 INFO L226 Difference]: Without dead ends: 5851 [2020-11-12 05:16:05,554 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-11-12 05:16:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5851 states. [2020-11-12 05:16:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5851 to 5851. [2020-11-12 05:16:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5851 states, 5770 states have (on average 1.6282495667244368) internal successors, (9395), 5850 states have internal predecessors, (9395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5851 states to 5851 states and 9395 transitions. [2020-11-12 05:16:05,660 INFO L78 Accepts]: Start accepts. Automaton has 5851 states and 9395 transitions. Word has length 88 [2020-11-12 05:16:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:16:05,660 INFO L481 AbstractCegarLoop]: Abstraction has 5851 states and 9395 transitions. [2020-11-12 05:16:05,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5851 states and 9395 transitions. [2020-11-12 05:16:05,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-12 05:16:05,667 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:16:05,667 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:16:05,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 05:16:05,668 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:16:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:16:05,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1194539894, now seen corresponding path program 1 times [2020-11-12 05:16:05,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:16:05,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647405611] [2020-11-12 05:16:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:16:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:16:05,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:16:05,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647405611] [2020-11-12 05:16:05,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:16:05,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:16:05,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342364496] [2020-11-12 05:16:05,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:16:05,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:16:05,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:16:05,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:16:05,850 INFO L87 Difference]: Start difference. First operand 5851 states and 9395 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:16:05,970 INFO L93 Difference]: Finished difference Result 9498 states and 15758 transitions. [2020-11-12 05:16:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 05:16:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2020-11-12 05:16:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:16:05,979 INFO L225 Difference]: With dead ends: 9498 [2020-11-12 05:16:05,979 INFO L226 Difference]: Without dead ends: 4811 [2020-11-12 05:16:05,979 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-12 05:16:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2020-11-12 05:16:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 4811. [2020-11-12 05:16:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4811 states, 4730 states have (on average 1.6471458773784355) internal successors, (7791), 4810 states have internal predecessors, (7791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:06,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 7791 transitions. [2020-11-12 05:16:06,070 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 7791 transitions. Word has length 93 [2020-11-12 05:16:06,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:16:06,071 INFO L481 AbstractCegarLoop]: Abstraction has 4811 states and 7791 transitions. [2020-11-12 05:16:06,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:06,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 7791 transitions. [2020-11-12 05:16:06,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-12 05:16:06,078 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:16:06,078 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:16:06,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 05:16:06,078 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:16:06,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:16:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2124027674, now seen corresponding path program 2 times [2020-11-12 05:16:06,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:16:06,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625487631] [2020-11-12 05:16:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:16:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:16:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:16:06,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625487631] [2020-11-12 05:16:06,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:16:06,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:16:06,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178022786] [2020-11-12 05:16:06,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:16:06,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:16:06,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:16:06,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:16:06,294 INFO L87 Difference]: Start difference. First operand 4811 states and 7791 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:16:06,430 INFO L93 Difference]: Finished difference Result 6428 states and 11394 transitions. [2020-11-12 05:16:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:16:06,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2020-11-12 05:16:06,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:16:06,435 INFO L225 Difference]: With dead ends: 6428 [2020-11-12 05:16:06,435 INFO L226 Difference]: Without dead ends: 3724 [2020-11-12 05:16:06,436 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:16:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-11-12 05:16:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3724. [2020-11-12 05:16:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3643 states have (on average 1.681306615426846) internal successors, (6125), 3723 states have internal predecessors, (6125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 6125 transitions. [2020-11-12 05:16:06,494 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 6125 transitions. Word has length 93 [2020-11-12 05:16:06,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:16:06,495 INFO L481 AbstractCegarLoop]: Abstraction has 3724 states and 6125 transitions. [2020-11-12 05:16:06,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:06,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 6125 transitions. [2020-11-12 05:16:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-12 05:16:06,500 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:16:06,501 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:16:06,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 05:16:06,501 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:16:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:16:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash -982589110, now seen corresponding path program 3 times [2020-11-12 05:16:06,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:16:06,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177582611] [2020-11-12 05:16:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:16:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:16:06,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:16:06,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177582611] [2020-11-12 05:16:06,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:16:06,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:16:06,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926364278] [2020-11-12 05:16:06,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:16:06,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:16:06,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:16:06,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:16:06,718 INFO L87 Difference]: Start difference. First operand 3724 states and 6125 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:06,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:16:06,836 INFO L93 Difference]: Finished difference Result 6091 states and 10399 transitions. [2020-11-12 05:16:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:16:06,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2020-11-12 05:16:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:16:06,842 INFO L225 Difference]: With dead ends: 6091 [2020-11-12 05:16:06,842 INFO L226 Difference]: Without dead ends: 2756 [2020-11-12 05:16:06,843 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-12 05:16:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2756 states. [2020-11-12 05:16:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2756 to 2756. [2020-11-12 05:16:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2675 states have (on average 1.7446728971962617) internal successors, (4667), 2755 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 4667 transitions. [2020-11-12 05:16:06,892 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 4667 transitions. Word has length 93 [2020-11-12 05:16:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:16:06,893 INFO L481 AbstractCegarLoop]: Abstraction has 2756 states and 4667 transitions. [2020-11-12 05:16:06,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 05:16:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 4667 transitions. [2020-11-12 05:16:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-12 05:16:06,897 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:16:06,897 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 05:16:06,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 05:16:06,898 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:16:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:16:06,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1335430026, now seen corresponding path program 4 times [2020-11-12 05:16:06,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:16:06,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785103930] [2020-11-12 05:16:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:16:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 05:16:06,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 05:16:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 05:16:07,188 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 05:16:07,272 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 05:16:07,272 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 05:16:07,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-12 05:16:07,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:16:07 BasicIcfg [2020-11-12 05:16:07,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 05:16:07,500 INFO L168 Benchmark]: Toolchain (without parser) took 100194.21 ms. Allocated memory was 302.0 MB in the beginning and 11.6 GB in the end (delta: 11.3 GB). Free memory was 277.1 MB in the beginning and 9.6 GB in the end (delta: -9.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 16.0 GB. [2020-11-12 05:16:07,501 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 05:16:07,502 INFO L168 Benchmark]: CACSL2BoogieTranslator took 828.34 ms. Allocated memory is still 302.0 MB. Free memory was 276.6 MB in the beginning and 281.6 MB in the end (delta: -5.0 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.0 GB. [2020-11-12 05:16:07,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.75 ms. Allocated memory is still 302.0 MB. Free memory was 281.6 MB in the beginning and 279.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 05:16:07,503 INFO L168 Benchmark]: Boogie Preprocessor took 90.41 ms. Allocated memory is still 302.0 MB. Free memory was 279.4 MB in the beginning and 276.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 05:16:07,504 INFO L168 Benchmark]: RCFGBuilder took 2970.79 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 276.3 MB in the beginning and 251.7 MB in the end (delta: 24.7 MB). Peak memory consumption was 173.6 MB. Max. memory is 16.0 GB. [2020-11-12 05:16:07,505 INFO L168 Benchmark]: TraceAbstraction took 96158.81 ms. Allocated memory was 362.8 MB in the beginning and 11.6 GB in the end (delta: 11.3 GB). Free memory was 250.6 MB in the beginning and 9.6 GB in the end (delta: -9.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.0 GB. [2020-11-12 05:16:07,509 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 828.34 ms. Allocated memory is still 302.0 MB. Free memory was 276.6 MB in the beginning and 281.6 MB in the end (delta: -5.0 MB). Peak memory consumption was 42.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 125.75 ms. Allocated memory is still 302.0 MB. Free memory was 281.6 MB in the beginning and 279.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 90.41 ms. Allocated memory is still 302.0 MB. Free memory was 279.4 MB in the beginning and 276.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2970.79 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 276.3 MB in the beginning and 251.7 MB in the end (delta: 24.7 MB). Peak memory consumption was 173.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 96158.81 ms. Allocated memory was 362.8 MB in the beginning and 11.6 GB in the end (delta: 11.3 GB). Free memory was 250.6 MB in the beginning and 9.6 GB in the end (delta: -9.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0] [L724] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L725] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L726] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L727] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L728] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L729] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L735] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L736] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L737] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L738] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L739] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L740] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L741] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L742] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L744] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t193; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t194; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t194, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L875] 0 pthread_t t195; VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L876] FCALL, FORK 0 pthread_create(&t195, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L877] 0 pthread_t t196; VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L878] FCALL, FORK 0 pthread_create(&t196, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] [L17] 0 __assert_fail ("0", "mix007_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 122 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 95.7s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 73.9s, HoareTripleCheckerStatistics: 1463 SDtfs, 2006 SDslu, 5258 SDs, 0 SdLazy, 520 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183752occurred 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: 10.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 5987 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 186198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...