/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/mix043_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 05:50:52,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 05:50:52,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 05:50:52,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 05:50:52,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 05:50:52,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 05:50:52,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 05:50:52,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 05:50:52,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 05:50:52,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 05:50:52,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 05:50:52,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 05:50:52,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 05:50:52,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 05:50:52,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 05:50:52,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 05:50:52,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 05:50:52,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 05:50:52,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 05:50:52,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 05:50:52,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 05:50:52,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 05:50:52,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 05:50:52,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 05:50:52,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 05:50:52,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 05:50:52,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 05:50:52,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 05:50:52,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 05:50:52,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 05:50:52,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 05:50:52,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 05:50:52,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 05:50:52,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 05:50:52,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 05:50:52,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 05:50:52,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 05:50:52,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 05:50:52,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 05:50:52,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 05:50:52,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 05:50:52,935 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:50:52,993 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 05:50:52,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 05:50:52,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 05:50:52,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 05:50:52,998 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 05:50:52,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 05:50:52,999 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 05:50:52,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 05:50:52,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 05:50:53,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 05:50:53,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 05:50:53,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 05:50:53,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 05:50:53,002 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 05:50:53,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 05:50:53,002 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 05:50:53,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 05:50:53,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 05:50:53,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 05:50:53,003 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 05:50:53,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 05:50:53,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 05:50:53,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 05:50:53,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 05:50:53,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 05:50:53,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 05:50:53,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 05:50:53,005 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-12 05:50:53,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 05:50:53,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-12 05:50:53,006 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:50:53,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 05:50:53,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 05:50:53,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 05:50:53,445 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 05:50:53,446 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 05:50:53,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2020-11-12 05:50:53,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c4f4617/7ed2d0c3e4ad41f49670d8ac44c507d8/FLAGad4e3bf4a [2020-11-12 05:50:54,434 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 05:50:54,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_tso.opt.i [2020-11-12 05:50:54,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c4f4617/7ed2d0c3e4ad41f49670d8ac44c507d8/FLAGad4e3bf4a [2020-11-12 05:50:54,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1c4f4617/7ed2d0c3e4ad41f49670d8ac44c507d8 [2020-11-12 05:50:54,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 05:50:54,662 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 05:50:54,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 05:50:54,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 05:50:54,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 05:50:54,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:50:54" (1/1) ... [2020-11-12 05:50:54,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9a3af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:54, skipping insertion in model container [2020-11-12 05:50:54,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:50:54" (1/1) ... [2020-11-12 05:50:54,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 05:50:54,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 05:50:55,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 05:50:55,226 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 05:50:55,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 05:50:55,470 INFO L208 MainTranslator]: Completed translation [2020-11-12 05:50:55,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55 WrapperNode [2020-11-12 05:50:55,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 05:50:55,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 05:50:55,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 05:50:55,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 05:50:55,494 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:50:55" (1/1) ... [2020-11-12 05:50:55,519 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:50:55" (1/1) ... [2020-11-12 05:50:55,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 05:50:55,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 05:50:55,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 05:50:55,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 05:50:55,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (1/1) ... [2020-11-12 05:50:55,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (1/1) ... [2020-11-12 05:50:55,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (1/1) ... [2020-11-12 05:50:55,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (1/1) ... [2020-11-12 05:50:55,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (1/1) ... [2020-11-12 05:50:55,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (1/1) ... [2020-11-12 05:50:55,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (1/1) ... [2020-11-12 05:50:55,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 05:50:55,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 05:50:55,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 05:50:55,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 05:50:55,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (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:50:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 05:50:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-12 05:50:55,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 05:50:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 05:50:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-12 05:50:55,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-12 05:50:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-12 05:50:55,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-12 05:50:55,719 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-12 05:50:55,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-12 05:50:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-12 05:50:55,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-12 05:50:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 05:50:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-12 05:50:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 05:50:55,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 05:50:55,723 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:50:57,963 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 05:50:57,963 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-12 05:50:57,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:50:57 BoogieIcfgContainer [2020-11-12 05:50:57,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 05:50:57,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 05:50:57,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 05:50:57,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 05:50:57,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:50:54" (1/3) ... [2020-11-12 05:50:57,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2516dea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:50:57, skipping insertion in model container [2020-11-12 05:50:57,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:50:55" (2/3) ... [2020-11-12 05:50:57,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2516dea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:50:57, skipping insertion in model container [2020-11-12 05:50:57,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:50:57" (3/3) ... [2020-11-12 05:50:57,975 INFO L111 eAbstractionObserver]: Analyzing ICFG mix043_tso.opt.i [2020-11-12 05:50:57,992 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 05:50:57,993 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 05:50:57,997 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-12 05:50:57,998 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 05:50:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,041 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,042 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,043 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,044 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,044 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,044 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,046 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,046 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,047 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,051 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,052 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,052 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,052 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,053 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,053 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,053 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,053 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,053 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,054 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,054 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,055 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,056 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,056 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,056 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,056 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,057 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,057 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,058 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,059 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,060 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,061 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,062 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,065 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,066 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,071 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,071 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,071 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,072 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,072 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,073 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,080 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,080 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,081 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,081 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 05:50:58,082 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 05:50:58,095 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-12 05:50:58,120 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 05:50:58,120 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 05:50:58,121 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 05:50:58,121 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 05:50:58,121 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 05:50:58,121 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 05:50:58,121 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 05:50:58,121 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 05:50:58,136 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132 places, 122 transitions, 264 flow [2020-11-12 05:51:38,487 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 135508 states, 135504 states have (on average 4.547371295312315) internal successors, (616187), 135507 states have internal predecessors, (616187), 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:51:38,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-12 05:51:38,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-12 05:51:38,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:51:38,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:51:38,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:51:38,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:51:38,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:38,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:38,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:38,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:38,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:38,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:38,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:38,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:38,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:38,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:38,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:38,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:38,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:38,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:38,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:38,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:38,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:39,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:39,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:39,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:39,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:39,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:39,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:39,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:39,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:39,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:39,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:39,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:39,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:39,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-12 05:51:39,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:51:39,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-12 05:51:39,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:39,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:39,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:40,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:40,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:40,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:40,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-12 05:51:40,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:40,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:40,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:40,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:40,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:40,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-12 05:51:40,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-12 05:51:40,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:51:40,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-12 05:51:40,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-12 05:51:40,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:51:40,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:51:40,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:51:40,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:51:40,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 05:51:40,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 05:51:40,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-12 05:51:40,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-12 05:51:40,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:51:40,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:51:40,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:51:40,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 05:51:40,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:51:40,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 05:51:40,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-12 05:51:40,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:40,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-11-12 05:51:40,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:40,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:40,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-11-12 05:51:40,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:40,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:40,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:40,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:40,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-12 05:51:40,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:51:40,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-12 05:51:40,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:41,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:41,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:41,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-12 05:51:41,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-12 05:51:41,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-12 05:51:41,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:41,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:41,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 05:51:41,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-12 05:51:41,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-12 05:51:41,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-12 05:51:41,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:41,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:41,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-12 05:51:41,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 05:51:41,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-12 05:51:41,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51: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:51:41,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,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:51:41,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 05:51:41,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 05:51:41,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 05:51:41,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:51:41,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:51:41,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:51:41,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 05:51:41,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 05:51:41,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:41,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:41,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:41,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:41,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:41,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:42,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:42,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:42,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:42,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:42,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:42,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:42,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:42,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:42,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:42,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-12 05:51:42,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:42,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-12 05:51:42,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 05:51:46,865 WARN L455 BasicCegarLoop]: Sleep Set Reduction Time: 8374ms [2020-11-12 05:51:47,011 WARN L456 BasicCegarLoop]: Sleep set: input automaton has 135508 states, 135504 states have (on average 4.547371295312315) internal successors, (616187), 135507 states have internal predecessors, (616187), 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:51:47,317 WARN L457 BasicCegarLoop]: Sleep set: output automaton has 135508 states, 121771 states have (on average 2.7526997396752924) internal successors, (335199), 135507 states have internal predecessors, (335199), 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:51:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 135508 states, 121771 states have (on average 2.7526997396752924) internal successors, (335199), 135507 states have internal predecessors, (335199), 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:51:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-12 05:51:47,521 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:51:47,522 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] [2020-11-12 05:51:47,523 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:51:47,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:51:47,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1117216746, now seen corresponding path program 1 times [2020-11-12 05:51:47,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:51:47,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532323678] [2020-11-12 05:51:47,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:51:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:51:48,041 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:51:48,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532323678] [2020-11-12 05:51:48,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:51:48,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 05:51:48,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074982423] [2020-11-12 05:51:48,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 05:51:48,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:51:48,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 05:51:48,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 05:51:48,175 INFO L87 Difference]: Start difference. First operand has 135508 states, 121771 states have (on average 2.7526997396752924) internal successors, (335199), 135507 states have internal predecessors, (335199), 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 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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:51:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:51:49,620 INFO L93 Difference]: Finished difference Result 115516 states and 267657 transitions. [2020-11-12 05:51:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 05:51:49,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2020-11-12 05:51:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:51:50,017 INFO L225 Difference]: With dead ends: 115516 [2020-11-12 05:51:50,018 INFO L226 Difference]: Without dead ends: 48879 [2020-11-12 05:51:50,019 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:51:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48879 states. [2020-11-12 05:51:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48879 to 48879. [2020-11-12 05:51:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48879 states, 48487 states have (on average 2.452327427970384) internal successors, (118906), 48878 states have internal predecessors, (118906), 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:51:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48879 states to 48879 states and 118906 transitions. [2020-11-12 05:51:53,373 INFO L78 Accepts]: Start accepts. Automaton has 48879 states and 118906 transitions. Word has length 58 [2020-11-12 05:51:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:51:53,377 INFO L481 AbstractCegarLoop]: Abstraction has 48879 states and 118906 transitions. [2020-11-12 05:51:53,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 29.0) internal successors, (58), 3 states have internal predecessors, (58), 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:51:53,378 INFO L276 IsEmpty]: Start isEmpty. Operand 48879 states and 118906 transitions. [2020-11-12 05:51:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2020-11-12 05:51:53,461 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:51:53,462 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:51:53,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 05:51:53,462 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:51:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:51:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash -183178716, now seen corresponding path program 1 times [2020-11-12 05:51:53,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:51:53,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608671518] [2020-11-12 05:51:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:51:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:51:53,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:51:53,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608671518] [2020-11-12 05:51:53,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:51:53,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:51:53,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881570284] [2020-11-12 05:51:53,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:51:53,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:51:53,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:51:53,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:51:53,824 INFO L87 Difference]: Start difference. First operand 48879 states and 118906 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:51:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:51:54,558 INFO L93 Difference]: Finished difference Result 48879 states and 125154 transitions. [2020-11-12 05:51:54,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:51:54,558 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:51:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:51:54,681 INFO L225 Difference]: With dead ends: 48879 [2020-11-12 05:51:54,681 INFO L226 Difference]: Without dead ends: 36335 [2020-11-12 05:51:54,682 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:51:55,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36335 states. [2020-11-12 05:51:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36335 to 36335. [2020-11-12 05:51:56,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36335 states, 35943 states have (on average 2.449489469437721) internal successors, (88042), 36334 states have internal predecessors, (88042), 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:51:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36335 states to 36335 states and 88042 transitions. [2020-11-12 05:51:56,328 INFO L78 Accepts]: Start accepts. Automaton has 36335 states and 88042 transitions. Word has length 71 [2020-11-12 05:51:56,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:51:56,329 INFO L481 AbstractCegarLoop]: Abstraction has 36335 states and 88042 transitions. [2020-11-12 05:51:56,329 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:51:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 36335 states and 88042 transitions. [2020-11-12 05:51:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-12 05:51:56,384 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:51:56,384 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] [2020-11-12 05:51:56,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 05:51:56,384 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:51:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:51:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1902491719, now seen corresponding path program 1 times [2020-11-12 05:51:56,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:51:56,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513791623] [2020-11-12 05:51:56,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:51:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:51:56,750 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:51:56,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513791623] [2020-11-12 05:51:56,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:51:56,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 05:51:56,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97635408] [2020-11-12 05:51:56,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 05:51:56,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:51:56,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 05:51:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 05:51:56,753 INFO L87 Difference]: Start difference. First operand 36335 states and 88042 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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:51:57,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:51:57,587 INFO L93 Difference]: Finished difference Result 40255 states and 101032 transitions. [2020-11-12 05:51:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 05:51:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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 75 [2020-11-12 05:51:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:51:57,728 INFO L225 Difference]: With dead ends: 40255 [2020-11-12 05:51:57,728 INFO L226 Difference]: Without dead ends: 33983 [2020-11-12 05:51:57,729 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-11-12 05:51:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33983 states. [2020-11-12 05:51:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33983 to 33983. [2020-11-12 05:51:58,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33983 states, 33591 states have (on average 2.3535470810633803) internal successors, (79058), 33982 states have internal predecessors, (79058), 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:51:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33983 states to 33983 states and 79058 transitions. [2020-11-12 05:51:58,996 INFO L78 Accepts]: Start accepts. Automaton has 33983 states and 79058 transitions. Word has length 75 [2020-11-12 05:51:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:51:58,996 INFO L481 AbstractCegarLoop]: Abstraction has 33983 states and 79058 transitions. [2020-11-12 05:51:58,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 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:51:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33983 states and 79058 transitions. [2020-11-12 05:51:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-12 05:51:59,050 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:51:59,051 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:51:59,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 05:51:59,051 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:51:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:51:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash -768603192, now seen corresponding path program 1 times [2020-11-12 05:51:59,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:51:59,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378732673] [2020-11-12 05:51:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:51:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:51:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 05:51:59,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378732673] [2020-11-12 05:51:59,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:51:59,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 05:51:59,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19138237] [2020-11-12 05:51:59,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 05:51:59,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:51:59,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 05:51:59,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 05:51:59,296 INFO L87 Difference]: Start difference. First operand 33983 states and 79058 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:51:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:51:59,591 INFO L93 Difference]: Finished difference Result 42015 states and 91383 transitions. [2020-11-12 05:51:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 05:51:59,591 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:51:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:51:59,664 INFO L225 Difference]: With dead ends: 42015 [2020-11-12 05:51:59,664 INFO L226 Difference]: Without dead ends: 29471 [2020-11-12 05:51:59,665 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:51:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29471 states. [2020-11-12 05:52:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29471 to 29471. [2020-11-12 05:52:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29471 states, 29079 states have (on average 2.379655421438151) internal successors, (69198), 29470 states have internal predecessors, (69198), 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:52:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29471 states to 29471 states and 69198 transitions. [2020-11-12 05:52:00,820 INFO L78 Accepts]: Start accepts. Automaton has 29471 states and 69198 transitions. Word has length 77 [2020-11-12 05:52:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:52:00,820 INFO L481 AbstractCegarLoop]: Abstraction has 29471 states and 69198 transitions. [2020-11-12 05:52:00,820 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:52:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 29471 states and 69198 transitions. [2020-11-12 05:52:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-12 05:52:00,854 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:52:00,854 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] [2020-11-12 05:52:00,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 05:52:00,854 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:52:00,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:52:00,855 INFO L82 PathProgramCache]: Analyzing trace with hash 140235520, now seen corresponding path program 1 times [2020-11-12 05:52:00,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:52:00,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014579792] [2020-11-12 05:52:00,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:52:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:52:01,035 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:52:01,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014579792] [2020-11-12 05:52:01,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:52:01,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:52:01,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252568304] [2020-11-12 05:52:01,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:52:01,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:52:01,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:52:01,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:52:01,038 INFO L87 Difference]: Start difference. First operand 29471 states and 69198 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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:52:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:52:01,394 INFO L93 Difference]: Finished difference Result 28559 states and 61459 transitions. [2020-11-12 05:52:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 05:52:01,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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 78 [2020-11-12 05:52:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:52:01,433 INFO L225 Difference]: With dead ends: 28559 [2020-11-12 05:52:01,433 INFO L226 Difference]: Without dead ends: 18087 [2020-11-12 05:52:01,434 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:52:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18087 states. [2020-11-12 05:52:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18087 to 18087. [2020-11-12 05:52:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18087 states, 17775 states have (on average 2.3752461322081575) internal successors, (42220), 18086 states have internal predecessors, (42220), 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:52:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18087 states to 18087 states and 42220 transitions. [2020-11-12 05:52:02,311 INFO L78 Accepts]: Start accepts. Automaton has 18087 states and 42220 transitions. Word has length 78 [2020-11-12 05:52:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:52:02,313 INFO L481 AbstractCegarLoop]: Abstraction has 18087 states and 42220 transitions. [2020-11-12 05:52:02,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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:52:02,314 INFO L276 IsEmpty]: Start isEmpty. Operand 18087 states and 42220 transitions. [2020-11-12 05:52:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-12 05:52:02,332 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:52:02,332 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] [2020-11-12 05:52:02,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 05:52:02,333 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:52:02,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:52:02,333 INFO L82 PathProgramCache]: Analyzing trace with hash 407842622, now seen corresponding path program 1 times [2020-11-12 05:52:02,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:52:02,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228210391] [2020-11-12 05:52:02,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:52:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:52:02,487 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:52:02,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228210391] [2020-11-12 05:52:02,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:52:02,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:52:02,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286761489] [2020-11-12 05:52:02,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:52:02,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:52:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:52:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:52:02,489 INFO L87 Difference]: Start difference. First operand 18087 states and 42220 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:52:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:52:02,731 INFO L93 Difference]: Finished difference Result 26257 states and 67082 transitions. [2020-11-12 05:52:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:52:02,732 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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 82 [2020-11-12 05:52:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:52:02,772 INFO L225 Difference]: With dead ends: 26257 [2020-11-12 05:52:02,773 INFO L226 Difference]: Without dead ends: 17225 [2020-11-12 05:52:02,773 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:52:02,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17225 states. [2020-11-12 05:52:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17225 to 14651. [2020-11-12 05:52:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14651 states, 14339 states have (on average 2.600181323662738) internal successors, (37284), 14650 states have internal predecessors, (37284), 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:52:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14651 states to 14651 states and 37284 transitions. [2020-11-12 05:52:03,189 INFO L78 Accepts]: Start accepts. Automaton has 14651 states and 37284 transitions. Word has length 82 [2020-11-12 05:52:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:52:03,189 INFO L481 AbstractCegarLoop]: Abstraction has 14651 states and 37284 transitions. [2020-11-12 05:52:03,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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:52:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 14651 states and 37284 transitions. [2020-11-12 05:52:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-12 05:52:03,204 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:52:03,205 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] [2020-11-12 05:52:03,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 05:52:03,205 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:52:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:52:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1806132144, now seen corresponding path program 2 times [2020-11-12 05:52:03,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:52:03,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107938546] [2020-11-12 05:52:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:52:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:52:03,430 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:52:03,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107938546] [2020-11-12 05:52:03,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:52:03,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 05:52:03,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824586896] [2020-11-12 05:52:03,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 05:52:03,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:52:03,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 05:52:03,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 05:52:03,433 INFO L87 Difference]: Start difference. First operand 14651 states and 37284 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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:52:03,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:52:03,702 INFO L93 Difference]: Finished difference Result 9953 states and 22249 transitions. [2020-11-12 05:52:03,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 05:52:03,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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 82 [2020-11-12 05:52:03,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:52:03,712 INFO L225 Difference]: With dead ends: 9953 [2020-11-12 05:52:03,712 INFO L226 Difference]: Without dead ends: 5323 [2020-11-12 05:52:03,713 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-11-12 05:52:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2020-11-12 05:52:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5323. [2020-11-12 05:52:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5323 states, 5179 states have (on average 2.455879513419579) internal successors, (12719), 5322 states have internal predecessors, (12719), 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:52:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 12719 transitions. [2020-11-12 05:52:04,091 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 12719 transitions. Word has length 82 [2020-11-12 05:52:04,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:52:04,092 INFO L481 AbstractCegarLoop]: Abstraction has 5323 states and 12719 transitions. [2020-11-12 05:52:04,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 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:52:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 12719 transitions. [2020-11-12 05:52:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-12 05:52:04,098 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:52:04,098 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] [2020-11-12 05:52:04,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 05:52:04,098 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:52:04,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:52:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash 545299794, now seen corresponding path program 1 times [2020-11-12 05:52:04,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:52:04,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829088019] [2020-11-12 05:52:04,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:52:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:52:04,246 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:52:04,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829088019] [2020-11-12 05:52:04,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:52:04,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:52:04,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340571799] [2020-11-12 05:52:04,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:52:04,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:52:04,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:52:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:52:04,249 INFO L87 Difference]: Start difference. First operand 5323 states and 12719 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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:52:04,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:52:04,407 INFO L93 Difference]: Finished difference Result 8397 states and 20746 transitions. [2020-11-12 05:52:04,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:52:04,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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 86 [2020-11-12 05:52:04,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:52:04,418 INFO L225 Difference]: With dead ends: 8397 [2020-11-12 05:52:04,419 INFO L226 Difference]: Without dead ends: 5491 [2020-11-12 05:52:04,419 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:52:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5491 states. [2020-11-12 05:52:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5491 to 5131. [2020-11-12 05:52:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5131 states, 4987 states have (on average 2.502105474233006) internal successors, (12478), 5130 states have internal predecessors, (12478), 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:52:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5131 states to 5131 states and 12478 transitions. [2020-11-12 05:52:04,541 INFO L78 Accepts]: Start accepts. Automaton has 5131 states and 12478 transitions. Word has length 86 [2020-11-12 05:52:04,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:52:04,542 INFO L481 AbstractCegarLoop]: Abstraction has 5131 states and 12478 transitions. [2020-11-12 05:52:04,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 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:52:04,542 INFO L276 IsEmpty]: Start isEmpty. Operand 5131 states and 12478 transitions. [2020-11-12 05:52:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-12 05:52:04,549 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:52:04,550 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] [2020-11-12 05:52:04,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 05:52:04,550 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:52:04,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:52:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash -414193300, now seen corresponding path program 2 times [2020-11-12 05:52:04,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:52:04,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047634636] [2020-11-12 05:52:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:52:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:52:04,763 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:52:04,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047634636] [2020-11-12 05:52:04,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:52:04,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 05:52:04,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128928510] [2020-11-12 05:52:04,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 05:52:04,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:52:04,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 05:52:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-12 05:52:04,771 INFO L87 Difference]: Start difference. First operand 5131 states and 12478 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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:52:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:52:05,072 INFO L93 Difference]: Finished difference Result 2863 states and 5741 transitions. [2020-11-12 05:52:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 05:52:05,073 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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 86 [2020-11-12 05:52:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:52:05,075 INFO L225 Difference]: With dead ends: 2863 [2020-11-12 05:52:05,075 INFO L226 Difference]: Without dead ends: 802 [2020-11-12 05:52:05,075 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:52:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2020-11-12 05:52:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2020-11-12 05:52:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 775 states have (on average 2.3316129032258064) internal successors, (1807), 801 states have internal predecessors, (1807), 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:52:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1807 transitions. [2020-11-12 05:52:05,089 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1807 transitions. Word has length 86 [2020-11-12 05:52:05,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:52:05,089 INFO L481 AbstractCegarLoop]: Abstraction has 802 states and 1807 transitions. [2020-11-12 05:52:05,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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:52:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1807 transitions. [2020-11-12 05:52:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-12 05:52:05,091 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:52:05,091 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] [2020-11-12 05:52:05,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 05:52:05,092 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:52:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:52:05,092 INFO L82 PathProgramCache]: Analyzing trace with hash -509435754, now seen corresponding path program 1 times [2020-11-12 05:52:05,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:52:05,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258700674] [2020-11-12 05:52:05,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:52:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 05:52:05,242 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:52:05,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258700674] [2020-11-12 05:52:05,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 05:52:05,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 05:52:05,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626132631] [2020-11-12 05:52:05,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 05:52:05,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 05:52:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 05:52:05,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 05:52:05,244 INFO L87 Difference]: Start difference. First operand 802 states and 1807 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:52:05,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 05:52:05,368 INFO L93 Difference]: Finished difference Result 1249 states and 2967 transitions. [2020-11-12 05:52:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 05:52:05,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 91 [2020-11-12 05:52:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 05:52:05,370 INFO L225 Difference]: With dead ends: 1249 [2020-11-12 05:52:05,370 INFO L226 Difference]: Without dead ends: 700 [2020-11-12 05:52:05,371 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:52:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-11-12 05:52:05,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2020-11-12 05:52:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 673 states have (on average 2.4650817236255573) internal successors, (1659), 699 states have internal predecessors, (1659), 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:52:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1659 transitions. [2020-11-12 05:52:05,384 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1659 transitions. Word has length 91 [2020-11-12 05:52:05,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 05:52:05,384 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 1659 transitions. [2020-11-12 05:52:05,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:52:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1659 transitions. [2020-11-12 05:52:05,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-12 05:52:05,386 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 05:52:05,386 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] [2020-11-12 05:52:05,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 05:52:05,387 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 05:52:05,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 05:52:05,387 INFO L82 PathProgramCache]: Analyzing trace with hash -690407658, now seen corresponding path program 2 times [2020-11-12 05:52:05,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 05:52:05,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918912970] [2020-11-12 05:52:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 05:52:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 05:52:05,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 05:52:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 05:52:05,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 05:52:05,621 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 05:52:05,621 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 05:52:05,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 05:52:05,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:52:05 BasicIcfg [2020-11-12 05:52:05,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 05:52:05,859 INFO L168 Benchmark]: Toolchain (without parser) took 71196.76 ms. Allocated memory was 302.0 MB in the beginning and 10.3 GB in the end (delta: 10.0 GB). Free memory was 275.7 MB in the beginning and 8.3 GB in the end (delta: -8.0 GB). Peak memory consumption was 2.0 GB. Max. memory is 16.0 GB. [2020-11-12 05:52:05,859 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 05:52:05,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.81 ms. Allocated memory is still 302.0 MB. Free memory was 275.2 MB in the beginning and 240.9 MB in the end (delta: 34.3 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. [2020-11-12 05:52:05,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.70 ms. Allocated memory is still 302.0 MB. Free memory was 240.8 MB in the beginning and 282.0 MB in the end (delta: -41.2 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2020-11-12 05:52:05,864 INFO L168 Benchmark]: Boogie Preprocessor took 65.15 ms. Allocated memory is still 302.0 MB. Free memory was 282.0 MB in the beginning and 279.9 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:52:05,865 INFO L168 Benchmark]: RCFGBuilder took 2327.08 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 279.9 MB in the beginning and 297.6 MB in the end (delta: -17.7 MB). Peak memory consumption was 178.3 MB. Max. memory is 16.0 GB. [2020-11-12 05:52:05,866 INFO L168 Benchmark]: TraceAbstraction took 67884.44 ms. Allocated memory was 362.8 MB in the beginning and 10.3 GB in the end (delta: 9.9 GB). Free memory was 297.6 MB in the beginning and 8.3 GB in the end (delta: -8.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 16.0 GB. [2020-11-12 05:52:05,872 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.21 ms. Allocated memory is still 302.0 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 803.81 ms. Allocated memory is still 302.0 MB. Free memory was 275.2 MB in the beginning and 240.9 MB in the end (delta: 34.3 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 86.70 ms. Allocated memory is still 302.0 MB. Free memory was 240.8 MB in the beginning and 282.0 MB in the end (delta: -41.2 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 65.15 ms. Allocated memory is still 302.0 MB. Free memory was 282.0 MB in the beginning and 279.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2327.08 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 279.9 MB in the beginning and 297.6 MB in the end (delta: -17.7 MB). Peak memory consumption was 178.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 67884.44 ms. Allocated memory was 362.8 MB in the beginning and 10.3 GB in the end (delta: 9.9 GB). Free memory was 297.6 MB in the beginning and 8.3 GB in the end (delta: -8.0 GB). Peak memory consumption was 1.9 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L722] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L730] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L731] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L732] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L733] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L734] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L735] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L736] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L737] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L738] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L739] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L740] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L741] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L742] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L743] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L744] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L745] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L746] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L747] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L748] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1157; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1157, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1158; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1158, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1159; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1159, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 pthread_t t1160; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t1160, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L17] 0 __assert_fail ("0", "mix043_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 67.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 49.1s, HoareTripleCheckerStatistics: 1464 SDtfs, 1893 SDslu, 4858 SDs, 0 SdLazy, 481 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135508occurred 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: 9.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 2934 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 877 NumberOfCodeBlocks, 877 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 178790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...