/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8
[2021-03-11 11:24:58,902 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-03-11 11:24:58,904 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-03-11 11:24:58,931 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-03-11 11:24:58,931 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-03-11 11:24:58,933 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-03-11 11:24:58,935 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-03-11 11:24:58,939 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-03-11 11:24:58,941 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-03-11 11:24:58,944 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-03-11 11:24:58,945 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-03-11 11:24:58,946 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-03-11 11:24:58,946 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-03-11 11:24:58,947 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-03-11 11:24:58,948 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-03-11 11:24:58,949 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-03-11 11:24:58,951 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-03-11 11:24:58,951 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-03-11 11:24:58,953 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-03-11 11:24:58,959 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-03-11 11:24:58,960 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-03-11 11:24:58,961 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-03-11 11:24:58,961 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-03-11 11:24:58,963 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-03-11 11:24:58,967 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-03-11 11:24:58,967 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-03-11 11:24:58,967 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-03-11 11:24:58,969 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-03-11 11:24:58,969 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-03-11 11:24:58,969 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-03-11 11:24:58,969 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-03-11 11:24:58,970 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-03-11 11:24:58,971 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-03-11 11:24:58,971 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-03-11 11:24:58,972 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-03-11 11:24:58,972 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-03-11 11:24:58,973 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-03-11 11:24:58,973 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-03-11 11:24:58,973 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-03-11 11:24:58,973 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-03-11 11:24:58,974 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-03-11 11:24:58,977 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-SemanticLbe.epf
[2021-03-11 11:24:59,002 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-03-11 11:24:59,002 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-03-11 11:24:59,005 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-03-11 11:24:59,005 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-03-11 11:24:59,005 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-03-11 11:24:59,005 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-03-11 11:24:59,005 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-03-11 11:24:59,005 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-03-11 11:24:59,005 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-03-11 11:24:59,006 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-03-11 11:24:59,006 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-03-11 11:24:59,006 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-03-11 11:24:59,006 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-03-11 11:24:59,006 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-03-11 11:24:59,007 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-03-11 11:24:59,007 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-03-11 11:24:59,007 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-03-11 11:24:59,007 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-03-11 11:24:59,007 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-03-11 11:24:59,007 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-03-11 11:24:59,007 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-03-11 11:24:59,007 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-03-11 11:24:59,008 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-03-11 11:24:59,008 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-03-11 11:24:59,008 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-03-11 11:24:59,008 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-03-11 11:24:59,008 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-03-11 11:24:59,008 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-03-11 11:24:59,008 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
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
[2021-03-11 11:24:59,245 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-03-11 11:24:59,260 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-03-11 11:24:59,262 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-03-11 11:24:59,263 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-03-11 11:24:59,263 INFO  L275        PluginConnector]: CDTParser initialized
[2021-03-11 11:24:59,264 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i
[2021-03-11 11:24:59,313 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e426a51/f802a7bdda1049598483e87615335f79/FLAGcd156f7fd
[2021-03-11 11:24:59,718 INFO  L306              CDTParser]: Found 1 translation units.
[2021-03-11 11:24:59,719 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i
[2021-03-11 11:24:59,734 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e426a51/f802a7bdda1049598483e87615335f79/FLAGcd156f7fd
[2021-03-11 11:24:59,748 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70e426a51/f802a7bdda1049598483e87615335f79
[2021-03-11 11:24:59,750 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-03-11 11:24:59,754 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-03-11 11:24:59,756 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-03-11 11:24:59,756 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-03-11 11:24:59,758 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-03-11 11:24:59,759 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:24:59" (1/1) ...
[2021-03-11 11:24:59,760 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36be1050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:24:59, skipping insertion in model container
[2021-03-11 11:24:59,760 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:24:59" (1/1) ...
[2021-03-11 11:24:59,764 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-03-11 11:24:59,806 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-03-11 11:24:59,952 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i[993,1006]
[2021-03-11 11:25:00,083 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-03-11 11:25:00,088 INFO  L203         MainTranslator]: Completed pre-run
[2021-03-11 11:25:00,095 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i[993,1006]
[2021-03-11 11:25:00,128 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-03-11 11:25:00,170 INFO  L208         MainTranslator]: Completed translation
[2021-03-11 11:25:00,171 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00 WrapperNode
[2021-03-11 11:25:00,171 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-03-11 11:25:00,172 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-03-11 11:25:00,172 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-03-11 11:25:00,172 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-03-11 11:25:00,176 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,188 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,207 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-03-11 11:25:00,208 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-03-11 11:25:00,208 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-03-11 11:25:00,208 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-03-11 11:25:00,213 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,213 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,216 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,217 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,224 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,227 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,229 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (1/1) ...
[2021-03-11 11:25:00,233 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-03-11 11:25:00,234 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-03-11 11:25:00,234 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-03-11 11:25:00,234 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-03-11 11:25:00,234 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (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
[2021-03-11 11:25:00,293 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-03-11 11:25:00,294 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-03-11 11:25:00,294 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-03-11 11:25:00,294 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-03-11 11:25:00,294 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-03-11 11:25:00,294 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-03-11 11:25:00,294 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-03-11 11:25:00,294 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-03-11 11:25:00,294 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-03-11 11:25:00,294 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-03-11 11:25:00,294 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-03-11 11:25:00,294 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-03-11 11:25:00,295 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-03-11 11:25:00,295 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-03-11 11:25:00,296 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-03-11 11:25:02,768 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-03-11 11:25:02,769 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-03-11 11:25:02,770 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:25:02 BoogieIcfgContainer
[2021-03-11 11:25:02,770 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-03-11 11:25:02,772 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-03-11 11:25:02,772 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-03-11 11:25:02,774 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-03-11 11:25:02,774 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:24:59" (1/3) ...
[2021-03-11 11:25:02,775 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7718d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:25:02, skipping insertion in model container
[2021-03-11 11:25:02,775 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:25:00" (2/3) ...
[2021-03-11 11:25:02,775 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7718d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:25:02, skipping insertion in model container
[2021-03-11 11:25:02,775 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:25:02" (3/3) ...
[2021-03-11 11:25:02,776 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe023_rmo.oepc.i
[2021-03-11 11:25:02,781 WARN  L142   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-03-11 11:25:02,781 INFO  L153   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-03-11 11:25:02,784 INFO  L165   ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-03-11 11:25:02,785 INFO  L323   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-03-11 11:25:02,824 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,825 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,825 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,825 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,825 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,825 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,825 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,825 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,825 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,826 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,827 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,828 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,829 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,830 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,831 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,833 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,834 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,834 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,834 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,834 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,834 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,834 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,834 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,835 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,836 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,838 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,839 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,841 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,844 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,845 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,846 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,847 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,848 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,849 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,850 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,851 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,851 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,851 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,852 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,853 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,854 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,854 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,854 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,855 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,856 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,857 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,863 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,863 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,863 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,863 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,864 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,864 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,864 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,866 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,866 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,866 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,866 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,866 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,866 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,866 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,866 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,867 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,869 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,870 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,871 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,873 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,875 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,876 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,877 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,878 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,878 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,878 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,878 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-03-11 11:25:02,879 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-03-11 11:25:02,891 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-03-11 11:25:02,910 INFO  L376      AbstractCegarLoop]: Interprodecural is true
[2021-03-11 11:25:02,910 INFO  L377      AbstractCegarLoop]: Hoare is true
[2021-03-11 11:25:02,910 INFO  L378      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-03-11 11:25:02,910 INFO  L379      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-03-11 11:25:02,910 INFO  L380      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-03-11 11:25:02,910 INFO  L381      AbstractCegarLoop]: Difference is false
[2021-03-11 11:25:02,910 INFO  L382      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-03-11 11:25:02,910 INFO  L386      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-03-11 11:25:02,921 INFO  L118   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-03-11 11:25:02,928 INFO  L133   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 213 flow
[2021-03-11 11:25:02,930 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 213 flow
[2021-03-11 11:25:02,931 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow
[2021-03-11 11:25:02,964 INFO  L129       PetriNetUnfolder]: 2/96 cut-off events.
[2021-03-11 11:25:02,964 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-03-11 11:25:02,967 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. 
[2021-03-11 11:25:02,969 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1786
[2021-03-11 11:25:04,356 WARN  L205               SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188
[2021-03-11 11:25:04,665 WARN  L205               SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 186
[2021-03-11 11:25:05,880 WARN  L205               SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 312 DAG size of output: 268
[2021-03-11 11:25:06,477 WARN  L205               SmtUtils]: Spent 595.00 ms on a formula simplification that was a NOOP. DAG size: 265
[2021-03-11 11:25:07,053 WARN  L205               SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60
[2021-03-11 11:25:07,432 WARN  L205               SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83
[2021-03-11 11:25:07,548 WARN  L205               SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-03-11 11:25:08,558 WARN  L205               SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 84
[2021-03-11 11:25:08,663 WARN  L205               SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 84
[2021-03-11 11:25:09,874 WARN  L205               SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114
[2021-03-11 11:25:09,995 WARN  L205               SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2021-03-11 11:25:10,258 WARN  L205               SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114
[2021-03-11 11:25:10,390 WARN  L205               SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 110
[2021-03-11 11:25:10,392 INFO  L131        LiptonReduction]: Checked pairs total: 4816
[2021-03-11 11:25:10,393 INFO  L133        LiptonReduction]: Total number of compositions: 83
[2021-03-11 11:25:10,399 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow
[2021-03-11 11:25:10,444 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 1166 states, 1162 states have (on average 3.4079173838209984) internal successors, (3960), 1165 states have internal predecessors, (3960), 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)
[2021-03-11 11:25:10,448 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1166 states, 1162 states have (on average 3.4079173838209984) internal successors, (3960), 1165 states have internal predecessors, (3960), 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)
[2021-03-11 11:25:10,451 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2021-03-11 11:25:10,451 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:10,451 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2021-03-11 11:25:10,451 INFO  L428      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:10,454 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:10,454 INFO  L82        PathProgramCache]: Analyzing trace with hash 1729436384, now seen corresponding path program 1 times
[2021-03-11 11:25:10,459 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:10,460 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787766597]
[2021-03-11 11:25:10,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:10,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:10,643 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:10,644 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:10,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:10,650 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787766597]
[2021-03-11 11:25:10,650 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:10,650 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-03-11 11:25:10,651 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731586892]
[2021-03-11 11:25:10,655 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-03-11 11:25:10,655 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:10,666 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-03-11 11:25:10,667 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-11 11:25:10,670 INFO  L87              Difference]: Start difference. First operand  has 1166 states, 1162 states have (on average 3.4079173838209984) internal successors, (3960), 1165 states have internal predecessors, (3960), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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)
[2021-03-11 11:25:10,770 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:10,771 INFO  L93              Difference]: Finished difference Result 974 states and 3122 transitions.
[2021-03-11 11:25:10,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-03-11 11:25:10,772 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5
[2021-03-11 11:25:10,772 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:10,792 INFO  L225             Difference]: With dead ends: 974
[2021-03-11 11:25:10,792 INFO  L226             Difference]: Without dead ends: 824
[2021-03-11 11:25:10,793 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-03-11 11:25:10,838 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 824 states.
[2021-03-11 11:25:10,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824.
[2021-03-11 11:25:10,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 824 states, 823 states have (on average 3.1676792223572297) internal successors, (2607), 823 states have internal predecessors, (2607), 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)
[2021-03-11 11:25:10,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2607 transitions.
[2021-03-11 11:25:10,895 INFO  L78                 Accepts]: Start accepts. Automaton has 824 states and 2607 transitions. Word has length 5
[2021-03-11 11:25:10,895 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:10,895 INFO  L480      AbstractCegarLoop]: Abstraction has 824 states and 2607 transitions.
[2021-03-11 11:25:10,895 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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)
[2021-03-11 11:25:10,895 INFO  L276                IsEmpty]: Start isEmpty. Operand 824 states and 2607 transitions.
[2021-03-11 11:25:10,896 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2021-03-11 11:25:10,896 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:10,897 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:10,897 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-03-11 11:25:10,897 INFO  L428      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:10,897 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:10,897 INFO  L82        PathProgramCache]: Analyzing trace with hash 1006222455, now seen corresponding path program 1 times
[2021-03-11 11:25:10,897 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:10,898 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872235850]
[2021-03-11 11:25:10,898 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:10,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:11,006 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,007 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:11,012 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,013 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:11,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:11,018 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872235850]
[2021-03-11 11:25:11,018 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:11,018 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-11 11:25:11,018 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109345061]
[2021-03-11 11:25:11,019 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-11 11:25:11,019 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:11,019 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-11 11:25:11,019 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-11 11:25:11,020 INFO  L87              Difference]: Start difference. First operand 824 states and 2607 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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)
[2021-03-11 11:25:11,048 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:11,049 INFO  L93              Difference]: Finished difference Result 914 states and 2784 transitions.
[2021-03-11 11:25:11,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-11 11:25:11,055 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10
[2021-03-11 11:25:11,055 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:11,059 INFO  L225             Difference]: With dead ends: 914
[2021-03-11 11:25:11,059 INFO  L226             Difference]: Without dead ends: 764
[2021-03-11 11:25:11,060 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-03-11 11:25:11,062 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 764 states.
[2021-03-11 11:25:11,075 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764.
[2021-03-11 11:25:11,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 764 states, 763 states have (on average 3.1310615989515074) internal successors, (2389), 763 states have internal predecessors, (2389), 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)
[2021-03-11 11:25:11,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 2389 transitions.
[2021-03-11 11:25:11,079 INFO  L78                 Accepts]: Start accepts. Automaton has 764 states and 2389 transitions. Word has length 10
[2021-03-11 11:25:11,079 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:11,079 INFO  L480      AbstractCegarLoop]: Abstraction has 764 states and 2389 transitions.
[2021-03-11 11:25:11,079 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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)
[2021-03-11 11:25:11,079 INFO  L276                IsEmpty]: Start isEmpty. Operand 764 states and 2389 transitions.
[2021-03-11 11:25:11,081 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-03-11 11:25:11,081 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:11,081 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:11,081 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-03-11 11:25:11,081 INFO  L428      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:11,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:11,081 INFO  L82        PathProgramCache]: Analyzing trace with hash 1128115955, now seen corresponding path program 1 times
[2021-03-11 11:25:11,081 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:11,081 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755006492]
[2021-03-11 11:25:11,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:11,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:11,126 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,126 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:11,128 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,129 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:11,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:11,138 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755006492]
[2021-03-11 11:25:11,138 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:11,138 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-03-11 11:25:11,138 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107616272]
[2021-03-11 11:25:11,139 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-11 11:25:11,139 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:11,139 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-11 11:25:11,139 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-11 11:25:11,139 INFO  L87              Difference]: Start difference. First operand 764 states and 2389 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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)
[2021-03-11 11:25:11,168 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:11,168 INFO  L93              Difference]: Finished difference Result 764 states and 2309 transitions.
[2021-03-11 11:25:11,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-11 11:25:11,169 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11
[2021-03-11 11:25:11,169 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:11,171 INFO  L225             Difference]: With dead ends: 764
[2021-03-11 11:25:11,171 INFO  L226             Difference]: Without dead ends: 644
[2021-03-11 11:25:11,172 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-03-11 11:25:11,173 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 644 states.
[2021-03-11 11:25:11,181 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644.
[2021-03-11 11:25:11,182 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 644 states, 643 states have (on average 3.052877138413686) internal successors, (1963), 643 states have internal predecessors, (1963), 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)
[2021-03-11 11:25:11,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1963 transitions.
[2021-03-11 11:25:11,184 INFO  L78                 Accepts]: Start accepts. Automaton has 644 states and 1963 transitions. Word has length 11
[2021-03-11 11:25:11,184 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:11,184 INFO  L480      AbstractCegarLoop]: Abstraction has 644 states and 1963 transitions.
[2021-03-11 11:25:11,184 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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)
[2021-03-11 11:25:11,184 INFO  L276                IsEmpty]: Start isEmpty. Operand 644 states and 1963 transitions.
[2021-03-11 11:25:11,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2021-03-11 11:25:11,186 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:11,186 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:11,186 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-03-11 11:25:11,186 INFO  L428      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:11,186 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:11,186 INFO  L82        PathProgramCache]: Analyzing trace with hash 862190585, now seen corresponding path program 1 times
[2021-03-11 11:25:11,186 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:11,186 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189623884]
[2021-03-11 11:25:11,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:11,250 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:11,272 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,272 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:11,275 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,275 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:11,278 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,279 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:11,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:11,284 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189623884]
[2021-03-11 11:25:11,285 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:11,285 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-11 11:25:11,285 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590637479]
[2021-03-11 11:25:11,285 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-11 11:25:11,285 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:11,285 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-11 11:25:11,285 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-03-11 11:25:11,285 INFO  L87              Difference]: Start difference. First operand 644 states and 1963 transitions. Second operand  has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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)
[2021-03-11 11:25:11,326 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:11,326 INFO  L93              Difference]: Finished difference Result 872 states and 2622 transitions.
[2021-03-11 11:25:11,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-11 11:25:11,327 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14
[2021-03-11 11:25:11,327 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:11,328 INFO  L225             Difference]: With dead ends: 872
[2021-03-11 11:25:11,329 INFO  L226             Difference]: Without dead ends: 452
[2021-03-11 11:25:11,329 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.6ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2021-03-11 11:25:11,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 452 states.
[2021-03-11 11:25:11,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452.
[2021-03-11 11:25:11,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 452 states, 451 states have (on average 2.87139689578714) internal successors, (1295), 451 states have internal predecessors, (1295), 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)
[2021-03-11 11:25:11,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1295 transitions.
[2021-03-11 11:25:11,337 INFO  L78                 Accepts]: Start accepts. Automaton has 452 states and 1295 transitions. Word has length 14
[2021-03-11 11:25:11,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:11,337 INFO  L480      AbstractCegarLoop]: Abstraction has 452 states and 1295 transitions.
[2021-03-11 11:25:11,337 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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)
[2021-03-11 11:25:11,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 452 states and 1295 transitions.
[2021-03-11 11:25:11,338 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-03-11 11:25:11,338 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:11,338 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:11,338 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-03-11 11:25:11,338 INFO  L428      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:11,338 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:11,338 INFO  L82        PathProgramCache]: Analyzing trace with hash 601994776, now seen corresponding path program 1 times
[2021-03-11 11:25:11,338 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:11,339 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675359318]
[2021-03-11 11:25:11,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:11,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:11,477 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,477 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 11:25:11,489 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 85.3 percent of original size
[2021-03-11 11:25:11,492 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58
[2021-03-11 11:25:11,517 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 86.8 percent of original size
[2021-03-11 11:25:11,521 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66
[2021-03-11 11:25:11,544 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,545 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26
[2021-03-11 11:25:11,562 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,563 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-03-11 11:25:11,582 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,584 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-11 11:25:11,585 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,585 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:11,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:11,593 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675359318]
[2021-03-11 11:25:11,593 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:11,594 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 11:25:11,594 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206932786]
[2021-03-11 11:25:11,594 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 11:25:11,594 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:11,595 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 11:25:11,595 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2021-03-11 11:25:11,595 INFO  L87              Difference]: Start difference. First operand 452 states and 1295 transitions. Second operand  has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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)
[2021-03-11 11:25:11,888 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:11,888 INFO  L93              Difference]: Finished difference Result 1018 states and 2882 transitions.
[2021-03-11 11:25:11,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-03-11 11:25:11,889 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 16
[2021-03-11 11:25:11,889 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:11,892 INFO  L225             Difference]: With dead ends: 1018
[2021-03-11 11:25:11,892 INFO  L226             Difference]: Without dead ends: 781
[2021-03-11 11:25:11,892 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 149.8ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156
[2021-03-11 11:25:11,894 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 781 states.
[2021-03-11 11:25:11,901 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 548.
[2021-03-11 11:25:11,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 548 states, 547 states have (on average 2.8080438756855575) internal successors, (1536), 547 states have internal predecessors, (1536), 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)
[2021-03-11 11:25:11,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1536 transitions.
[2021-03-11 11:25:11,904 INFO  L78                 Accepts]: Start accepts. Automaton has 548 states and 1536 transitions. Word has length 16
[2021-03-11 11:25:11,904 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:11,904 INFO  L480      AbstractCegarLoop]: Abstraction has 548 states and 1536 transitions.
[2021-03-11 11:25:11,904 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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)
[2021-03-11 11:25:11,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 548 states and 1536 transitions.
[2021-03-11 11:25:11,905 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-03-11 11:25:11,905 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:11,905 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:11,905 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-03-11 11:25:11,905 INFO  L428      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:11,906 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:11,906 INFO  L82        PathProgramCache]: Analyzing trace with hash -1539087174, now seen corresponding path program 2 times
[2021-03-11 11:25:11,906 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:11,906 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363089426]
[2021-03-11 11:25:11,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:11,934 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:11,965 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,966 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 11:25:11,972 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,972 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-11 11:25:11,982 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size
[2021-03-11 11:25:11,983 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44
[2021-03-11 11:25:11,995 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:11,996 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 11:25:12,001 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,002 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 11:25:12,010 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,010 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 11:25:12,011 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,011 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:12,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:12,018 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363089426]
[2021-03-11 11:25:12,018 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:12,018 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 11:25:12,018 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943519904]
[2021-03-11 11:25:12,019 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 11:25:12,019 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:12,019 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 11:25:12,019 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2021-03-11 11:25:12,019 INFO  L87              Difference]: Start difference. First operand 548 states and 1536 transitions. Second operand  has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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)
[2021-03-11 11:25:12,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:12,179 INFO  L93              Difference]: Finished difference Result 646 states and 1791 transitions.
[2021-03-11 11:25:12,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-03-11 11:25:12,180 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 16
[2021-03-11 11:25:12,180 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:12,182 INFO  L225             Difference]: With dead ends: 646
[2021-03-11 11:25:12,182 INFO  L226             Difference]: Without dead ends: 608
[2021-03-11 11:25:12,182 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 50.7ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2021-03-11 11:25:12,184 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 608 states.
[2021-03-11 11:25:12,191 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 556.
[2021-03-11 11:25:12,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 556 states, 555 states have (on average 2.798198198198198) internal successors, (1553), 555 states have internal predecessors, (1553), 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)
[2021-03-11 11:25:12,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1553 transitions.
[2021-03-11 11:25:12,194 INFO  L78                 Accepts]: Start accepts. Automaton has 556 states and 1553 transitions. Word has length 16
[2021-03-11 11:25:12,194 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:12,194 INFO  L480      AbstractCegarLoop]: Abstraction has 556 states and 1553 transitions.
[2021-03-11 11:25:12,194 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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)
[2021-03-11 11:25:12,194 INFO  L276                IsEmpty]: Start isEmpty. Operand 556 states and 1553 transitions.
[2021-03-11 11:25:12,195 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-03-11 11:25:12,195 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:12,195 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:12,196 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-03-11 11:25:12,196 INFO  L428      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:12,199 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:12,199 INFO  L82        PathProgramCache]: Analyzing trace with hash -368622790, now seen corresponding path program 3 times
[2021-03-11 11:25:12,199 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:12,199 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311466663]
[2021-03-11 11:25:12,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:12,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:12,302 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,303 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22
[2021-03-11 11:25:12,319 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,321 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25
[2021-03-11 11:25:12,340 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size
[2021-03-11 11:25:12,341 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53
[2021-03-11 11:25:12,359 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,359 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-11 11:25:12,374 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,374 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11
[2021-03-11 11:25:12,384 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,384 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-03-11 11:25:12,395 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,395 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:12,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:12,403 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311466663]
[2021-03-11 11:25:12,403 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:12,403 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-11 11:25:12,405 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314099370]
[2021-03-11 11:25:12,405 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-03-11 11:25:12,405 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:12,406 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-03-11 11:25:12,406 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2021-03-11 11:25:12,406 INFO  L87              Difference]: Start difference. First operand 556 states and 1553 transitions. Second operand  has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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)
[2021-03-11 11:25:12,596 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:12,597 INFO  L93              Difference]: Finished difference Result 637 states and 1754 transitions.
[2021-03-11 11:25:12,597 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-03-11 11:25:12,597 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 16
[2021-03-11 11:25:12,597 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:12,599 INFO  L225             Difference]: With dead ends: 637
[2021-03-11 11:25:12,599 INFO  L226             Difference]: Without dead ends: 599
[2021-03-11 11:25:12,600 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 142.1ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132
[2021-03-11 11:25:12,601 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 599 states.
[2021-03-11 11:25:12,608 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 546.
[2021-03-11 11:25:12,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 546 states, 545 states have (on average 2.8036697247706424) internal successors, (1528), 545 states have internal predecessors, (1528), 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)
[2021-03-11 11:25:12,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1528 transitions.
[2021-03-11 11:25:12,611 INFO  L78                 Accepts]: Start accepts. Automaton has 546 states and 1528 transitions. Word has length 16
[2021-03-11 11:25:12,611 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:12,611 INFO  L480      AbstractCegarLoop]: Abstraction has 546 states and 1528 transitions.
[2021-03-11 11:25:12,611 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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)
[2021-03-11 11:25:12,611 INFO  L276                IsEmpty]: Start isEmpty. Operand 546 states and 1528 transitions.
[2021-03-11 11:25:12,612 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-03-11 11:25:12,612 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:12,612 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:12,612 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-03-11 11:25:12,612 INFO  L428      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:12,612 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:12,612 INFO  L82        PathProgramCache]: Analyzing trace with hash -987817114, now seen corresponding path program 1 times
[2021-03-11 11:25:12,612 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:12,612 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833945105]
[2021-03-11 11:25:12,613 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:12,690 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:12,718 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,718 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:12,721 INFO  L142       QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-03-11 11:25:12,721 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-03-11 11:25:12,732 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,733 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 11:25:12,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:12,733 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833945105]
[2021-03-11 11:25:12,733 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:12,733 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-03-11 11:25:12,733 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873416911]
[2021-03-11 11:25:12,733 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-03-11 11:25:12,733 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:12,734 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-03-11 11:25:12,734 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-03-11 11:25:12,734 INFO  L87              Difference]: Start difference. First operand 546 states and 1528 transitions. Second operand  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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)
[2021-03-11 11:25:12,753 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:12,753 INFO  L93              Difference]: Finished difference Result 524 states and 1309 transitions.
[2021-03-11 11:25:12,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-03-11 11:25:12,754 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 17
[2021-03-11 11:25:12,754 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:12,755 INFO  L225             Difference]: With dead ends: 524
[2021-03-11 11:25:12,755 INFO  L226             Difference]: Without dead ends: 398
[2021-03-11 11:25:12,756 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-03-11 11:25:12,757 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 398 states.
[2021-03-11 11:25:12,761 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398.
[2021-03-11 11:25:12,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 398 states, 397 states have (on average 2.4483627204030225) internal successors, (972), 397 states have internal predecessors, (972), 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)
[2021-03-11 11:25:12,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 972 transitions.
[2021-03-11 11:25:12,762 INFO  L78                 Accepts]: Start accepts. Automaton has 398 states and 972 transitions. Word has length 17
[2021-03-11 11:25:12,763 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:12,763 INFO  L480      AbstractCegarLoop]: Abstraction has 398 states and 972 transitions.
[2021-03-11 11:25:12,763 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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)
[2021-03-11 11:25:12,763 INFO  L276                IsEmpty]: Start isEmpty. Operand 398 states and 972 transitions.
[2021-03-11 11:25:12,763 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2021-03-11 11:25:12,764 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:12,764 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:12,764 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-03-11 11:25:12,764 INFO  L428      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:12,764 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:12,764 INFO  L82        PathProgramCache]: Analyzing trace with hash -1289706286, now seen corresponding path program 1 times
[2021-03-11 11:25:12,764 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:12,764 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029098067]
[2021-03-11 11:25:12,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:12,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:12,823 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,823 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:12,825 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,826 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:12,832 INFO  L142       QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-03-11 11:25:12,832 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-03-11 11:25:12,846 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,846 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 11:25:12,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:12,846 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029098067]
[2021-03-11 11:25:12,847 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:12,847 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-03-11 11:25:12,847 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495579600]
[2021-03-11 11:25:12,847 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-03-11 11:25:12,847 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:12,847 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-03-11 11:25:12,849 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-03-11 11:25:12,849 INFO  L87              Difference]: Start difference. First operand 398 states and 972 transitions. Second operand  has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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)
[2021-03-11 11:25:12,877 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:12,877 INFO  L93              Difference]: Finished difference Result 329 states and 747 transitions.
[2021-03-11 11:25:12,878 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-03-11 11:25:12,878 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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 18
[2021-03-11 11:25:12,878 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:12,879 INFO  L225             Difference]: With dead ends: 329
[2021-03-11 11:25:12,879 INFO  L226             Difference]: Without dead ends: 266
[2021-03-11 11:25:12,879 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.2ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-03-11 11:25:12,880 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2021-03-11 11:25:12,883 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242.
[2021-03-11 11:25:12,883 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 242 states, 241 states have (on average 2.211618257261411) internal successors, (533), 241 states have internal predecessors, (533), 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)
[2021-03-11 11:25:12,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 533 transitions.
[2021-03-11 11:25:12,884 INFO  L78                 Accepts]: Start accepts. Automaton has 242 states and 533 transitions. Word has length 18
[2021-03-11 11:25:12,884 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:12,884 INFO  L480      AbstractCegarLoop]: Abstraction has 242 states and 533 transitions.
[2021-03-11 11:25:12,884 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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)
[2021-03-11 11:25:12,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 242 states and 533 transitions.
[2021-03-11 11:25:12,885 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-03-11 11:25:12,885 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:12,885 INFO  L519         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-03-11 11:25:12,885 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-03-11 11:25:12,885 INFO  L428      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:12,885 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:12,885 INFO  L82        PathProgramCache]: Analyzing trace with hash 1082984208, now seen corresponding path program 1 times
[2021-03-11 11:25:12,885 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:12,885 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210871440]
[2021-03-11 11:25:12,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:12,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:12,968 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,969 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:12,971 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,972 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:12,974 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,975 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:12,980 INFO  L142       QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size
[2021-03-11 11:25:12,982 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23
[2021-03-11 11:25:12,994 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:12,994 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1
[2021-03-11 11:25:12,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:12,994 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210871440]
[2021-03-11 11:25:12,994 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:12,994 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 11:25:12,995 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72730123]
[2021-03-11 11:25:12,995 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-03-11 11:25:12,995 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:12,995 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-03-11 11:25:12,995 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-03-11 11:25:12,995 INFO  L87              Difference]: Start difference. First operand 242 states and 533 transitions. Second operand  has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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)
[2021-03-11 11:25:13,038 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:13,038 INFO  L93              Difference]: Finished difference Result 217 states and 481 transitions.
[2021-03-11 11:25:13,039 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-03-11 11:25:13,039 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 20
[2021-03-11 11:25:13,040 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:13,041 INFO  L225             Difference]: With dead ends: 217
[2021-03-11 11:25:13,041 INFO  L226             Difference]: Without dead ends: 204
[2021-03-11 11:25:13,041 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 40.1ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2021-03-11 11:25:13,041 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2021-03-11 11:25:13,043 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 168.
[2021-03-11 11:25:13,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 168 states, 167 states have (on average 2.269461077844311) internal successors, (379), 167 states have internal predecessors, (379), 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)
[2021-03-11 11:25:13,044 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 379 transitions.
[2021-03-11 11:25:13,044 INFO  L78                 Accepts]: Start accepts. Automaton has 168 states and 379 transitions. Word has length 20
[2021-03-11 11:25:13,044 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:13,044 INFO  L480      AbstractCegarLoop]: Abstraction has 168 states and 379 transitions.
[2021-03-11 11:25:13,044 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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)
[2021-03-11 11:25:13,044 INFO  L276                IsEmpty]: Start isEmpty. Operand 168 states and 379 transitions.
[2021-03-11 11:25:13,044 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-03-11 11:25:13,044 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:13,045 INFO  L519         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]
[2021-03-11 11:25:13,045 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-03-11 11:25:13,045 INFO  L428      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:13,045 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:13,045 INFO  L82        PathProgramCache]: Analyzing trace with hash 1152124582, now seen corresponding path program 1 times
[2021-03-11 11:25:13,045 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:13,045 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407936613]
[2021-03-11 11:25:13,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:13,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:13,138 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:13,139 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:13,142 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 66.7 percent of original size
[2021-03-11 11:25:13,143 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18
[2021-03-11 11:25:13,152 INFO  L142       QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size
[2021-03-11 11:25:13,153 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29
[2021-03-11 11:25:13,168 INFO  L142       QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size
[2021-03-11 11:25:13,170 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34
[2021-03-11 11:25:13,186 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:13,187 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 11:25:13,195 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:13,195 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:13,202 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:13,202 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:13,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:13,209 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407936613]
[2021-03-11 11:25:13,210 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:13,210 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-03-11 11:25:13,210 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896924462]
[2021-03-11 11:25:13,210 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-03-11 11:25:13,210 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:13,210 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-03-11 11:25:13,210 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2021-03-11 11:25:13,210 INFO  L87              Difference]: Start difference. First operand 168 states and 379 transitions. Second operand  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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)
[2021-03-11 11:25:13,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:13,586 INFO  L93              Difference]: Finished difference Result 340 states and 733 transitions.
[2021-03-11 11:25:13,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-03-11 11:25:13,587 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 23
[2021-03-11 11:25:13,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:13,588 INFO  L225             Difference]: With dead ends: 340
[2021-03-11 11:25:13,588 INFO  L226             Difference]: Without dead ends: 289
[2021-03-11 11:25:13,588 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 169.3ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306
[2021-03-11 11:25:13,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2021-03-11 11:25:13,591 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 198.
[2021-03-11 11:25:13,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198 states, 197 states have (on average 2.314720812182741) internal successors, (456), 197 states have internal predecessors, (456), 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)
[2021-03-11 11:25:13,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 456 transitions.
[2021-03-11 11:25:13,592 INFO  L78                 Accepts]: Start accepts. Automaton has 198 states and 456 transitions. Word has length 23
[2021-03-11 11:25:13,592 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:13,592 INFO  L480      AbstractCegarLoop]: Abstraction has 198 states and 456 transitions.
[2021-03-11 11:25:13,592 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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)
[2021-03-11 11:25:13,592 INFO  L276                IsEmpty]: Start isEmpty. Operand 198 states and 456 transitions.
[2021-03-11 11:25:13,592 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-03-11 11:25:13,592 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:13,592 INFO  L519         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]
[2021-03-11 11:25:13,593 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-03-11 11:25:13,593 INFO  L428      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:13,593 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:13,593 INFO  L82        PathProgramCache]: Analyzing trace with hash -1480212498, now seen corresponding path program 2 times
[2021-03-11 11:25:13,593 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:13,593 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568389617]
[2021-03-11 11:25:13,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:13,636 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:13,669 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:13,670 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10
[2021-03-11 11:25:13,677 INFO  L142       QuantifierPusher]: treesize reduction 19, result has 74.3 percent of original size
[2021-03-11 11:25:13,678 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55
[2021-03-11 11:25:13,697 INFO  L142       QuantifierPusher]: treesize reduction 21, result has 72.4 percent of original size
[2021-03-11 11:25:13,698 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55
[2021-03-11 11:25:13,724 INFO  L142       QuantifierPusher]: treesize reduction 21, result has 73.8 percent of original size
[2021-03-11 11:25:13,724 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59
[2021-03-11 11:25:13,756 INFO  L142       QuantifierPusher]: treesize reduction 47, result has 53.0 percent of original size
[2021-03-11 11:25:13,757 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53
[2021-03-11 11:25:13,787 INFO  L142       QuantifierPusher]: treesize reduction 63, result has 46.2 percent of original size
[2021-03-11 11:25:13,788 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54
[2021-03-11 11:25:13,815 INFO  L142       QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size
[2021-03-11 11:25:13,815 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32
[2021-03-11 11:25:13,838 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:13,838 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4
[2021-03-11 11:25:13,847 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:13,848 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:13,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:13,858 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568389617]
[2021-03-11 11:25:13,858 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:13,858 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-03-11 11:25:13,858 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80293775]
[2021-03-11 11:25:13,858 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-03-11 11:25:13,858 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:13,859 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-03-11 11:25:13,859 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2021-03-11 11:25:13,859 INFO  L87              Difference]: Start difference. First operand 198 states and 456 transitions. Second operand  has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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)
[2021-03-11 11:25:14,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:14,172 INFO  L93              Difference]: Finished difference Result 355 states and 762 transitions.
[2021-03-11 11:25:14,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-03-11 11:25:14,172 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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 23
[2021-03-11 11:25:14,172 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:14,173 INFO  L225             Difference]: With dead ends: 355
[2021-03-11 11:25:14,173 INFO  L226             Difference]: Without dead ends: 290
[2021-03-11 11:25:14,174 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 242.6ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210
[2021-03-11 11:25:14,174 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2021-03-11 11:25:14,176 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 198.
[2021-03-11 11:25:14,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198 states, 197 states have (on average 2.2741116751269037) internal successors, (448), 197 states have internal predecessors, (448), 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)
[2021-03-11 11:25:14,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 448 transitions.
[2021-03-11 11:25:14,177 INFO  L78                 Accepts]: Start accepts. Automaton has 198 states and 448 transitions. Word has length 23
[2021-03-11 11:25:14,177 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:14,177 INFO  L480      AbstractCegarLoop]: Abstraction has 198 states and 448 transitions.
[2021-03-11 11:25:14,177 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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)
[2021-03-11 11:25:14,177 INFO  L276                IsEmpty]: Start isEmpty. Operand 198 states and 448 transitions.
[2021-03-11 11:25:14,178 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-03-11 11:25:14,178 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:14,178 INFO  L519         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]
[2021-03-11 11:25:14,178 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-03-11 11:25:14,178 INFO  L428      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:14,178 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:14,178 INFO  L82        PathProgramCache]: Analyzing trace with hash -1523024858, now seen corresponding path program 3 times
[2021-03-11 11:25:14,178 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:14,178 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907100935]
[2021-03-11 11:25:14,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:14,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:14,293 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:14,294 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:14,297 INFO  L142       QuantifierPusher]: treesize reduction 19, result has 73.2 percent of original size
[2021-03-11 11:25:14,298 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52
[2021-03-11 11:25:14,317 INFO  L142       QuantifierPusher]: treesize reduction 29, result has 50.8 percent of original size
[2021-03-11 11:25:14,318 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30
[2021-03-11 11:25:14,332 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:14,336 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3
[2021-03-11 11:25:14,342 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:14,342 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:14,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:14,350 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907100935]
[2021-03-11 11:25:14,351 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:14,351 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-03-11 11:25:14,351 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263368531]
[2021-03-11 11:25:14,351 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-03-11 11:25:14,351 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:14,352 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-03-11 11:25:14,352 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-03-11 11:25:14,352 INFO  L87              Difference]: Start difference. First operand 198 states and 448 transitions. Second operand  has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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)
[2021-03-11 11:25:14,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:14,559 INFO  L93              Difference]: Finished difference Result 329 states and 707 transitions.
[2021-03-11 11:25:14,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2021-03-11 11:25:14,559 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23
[2021-03-11 11:25:14,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:14,560 INFO  L225             Difference]: With dead ends: 329
[2021-03-11 11:25:14,560 INFO  L226             Difference]: Without dead ends: 268
[2021-03-11 11:25:14,560 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 81.2ms TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2021-03-11 11:25:14,561 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 268 states.
[2021-03-11 11:25:14,564 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 212.
[2021-03-11 11:25:14,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 212 states, 211 states have (on average 2.241706161137441) internal successors, (473), 211 states have internal predecessors, (473), 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)
[2021-03-11 11:25:14,565 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 473 transitions.
[2021-03-11 11:25:14,565 INFO  L78                 Accepts]: Start accepts. Automaton has 212 states and 473 transitions. Word has length 23
[2021-03-11 11:25:14,565 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:14,565 INFO  L480      AbstractCegarLoop]: Abstraction has 212 states and 473 transitions.
[2021-03-11 11:25:14,565 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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)
[2021-03-11 11:25:14,565 INFO  L276                IsEmpty]: Start isEmpty. Operand 212 states and 473 transitions.
[2021-03-11 11:25:14,566 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-03-11 11:25:14,566 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:14,566 INFO  L519         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]
[2021-03-11 11:25:14,566 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-03-11 11:25:14,566 INFO  L428      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:14,566 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:14,566 INFO  L82        PathProgramCache]: Analyzing trace with hash -346175888, now seen corresponding path program 4 times
[2021-03-11 11:25:14,566 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:14,566 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289234781]
[2021-03-11 11:25:14,567 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:14,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:14,644 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:14,645 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 11:25:14,650 INFO  L142       QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size
[2021-03-11 11:25:14,650 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21
[2021-03-11 11:25:14,661 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:14,661 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-11 11:25:14,672 INFO  L142       QuantifierPusher]: treesize reduction 26, result has 57.4 percent of original size
[2021-03-11 11:25:14,672 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35
[2021-03-11 11:25:14,692 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:14,693 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 11:25:14,701 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:14,701 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:14,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:14,710 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289234781]
[2021-03-11 11:25:14,710 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:14,710 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-03-11 11:25:14,710 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63314179]
[2021-03-11 11:25:14,710 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-03-11 11:25:14,710 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:14,711 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-03-11 11:25:14,711 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2021-03-11 11:25:14,711 INFO  L87              Difference]: Start difference. First operand 212 states and 473 transitions. Second operand  has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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)
[2021-03-11 11:25:14,970 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:14,970 INFO  L93              Difference]: Finished difference Result 342 states and 731 transitions.
[2021-03-11 11:25:14,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-03-11 11:25:14,971 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 23
[2021-03-11 11:25:14,971 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:14,972 INFO  L225             Difference]: With dead ends: 342
[2021-03-11 11:25:14,972 INFO  L226             Difference]: Without dead ends: 219
[2021-03-11 11:25:14,972 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 135.5ms TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2021-03-11 11:25:14,972 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 219 states.
[2021-03-11 11:25:14,974 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 173.
[2021-03-11 11:25:14,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 172 states have (on average 2.145348837209302) internal successors, (369), 172 states have internal predecessors, (369), 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)
[2021-03-11 11:25:14,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 369 transitions.
[2021-03-11 11:25:14,975 INFO  L78                 Accepts]: Start accepts. Automaton has 173 states and 369 transitions. Word has length 23
[2021-03-11 11:25:14,975 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:14,975 INFO  L480      AbstractCegarLoop]: Abstraction has 173 states and 369 transitions.
[2021-03-11 11:25:14,975 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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)
[2021-03-11 11:25:14,975 INFO  L276                IsEmpty]: Start isEmpty. Operand 173 states and 369 transitions.
[2021-03-11 11:25:14,975 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-03-11 11:25:14,975 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:14,975 INFO  L519         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]
[2021-03-11 11:25:14,975 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-03-11 11:25:14,975 INFO  L428      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:14,976 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:14,976 INFO  L82        PathProgramCache]: Analyzing trace with hash 1794407016, now seen corresponding path program 5 times
[2021-03-11 11:25:14,976 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:14,976 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295399296]
[2021-03-11 11:25:14,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:15,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:15,066 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,067 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13
[2021-03-11 11:25:15,075 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 85.5 percent of original size
[2021-03-11 11:25:15,075 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59
[2021-03-11 11:25:15,098 INFO  L142       QuantifierPusher]: treesize reduction 10, result has 86.1 percent of original size
[2021-03-11 11:25:15,099 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62
[2021-03-11 11:25:15,127 INFO  L142       QuantifierPusher]: treesize reduction 33, result has 60.7 percent of original size
[2021-03-11 11:25:15,128 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51
[2021-03-11 11:25:15,162 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,162 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20
[2021-03-11 11:25:15,176 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,177 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14
[2021-03-11 11:25:15,190 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,191 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7
[2021-03-11 11:25:15,200 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,201 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:15,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:15,212 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295399296]
[2021-03-11 11:25:15,212 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:15,212 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-03-11 11:25:15,212 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585113427]
[2021-03-11 11:25:15,213 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-03-11 11:25:15,213 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:15,213 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-03-11 11:25:15,213 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2021-03-11 11:25:15,213 INFO  L87              Difference]: Start difference. First operand 173 states and 369 transitions. Second operand  has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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)
[2021-03-11 11:25:15,459 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:15,460 INFO  L93              Difference]: Finished difference Result 331 states and 693 transitions.
[2021-03-11 11:25:15,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-03-11 11:25:15,460 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 23
[2021-03-11 11:25:15,460 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:15,461 INFO  L225             Difference]: With dead ends: 331
[2021-03-11 11:25:15,461 INFO  L226             Difference]: Without dead ends: 240
[2021-03-11 11:25:15,462 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 165.5ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156
[2021-03-11 11:25:15,462 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 240 states.
[2021-03-11 11:25:15,464 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 194.
[2021-03-11 11:25:15,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 194 states, 193 states have (on average 2.1295336787564767) internal successors, (411), 193 states have internal predecessors, (411), 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)
[2021-03-11 11:25:15,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 411 transitions.
[2021-03-11 11:25:15,465 INFO  L78                 Accepts]: Start accepts. Automaton has 194 states and 411 transitions. Word has length 23
[2021-03-11 11:25:15,465 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:15,465 INFO  L480      AbstractCegarLoop]: Abstraction has 194 states and 411 transitions.
[2021-03-11 11:25:15,465 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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)
[2021-03-11 11:25:15,465 INFO  L276                IsEmpty]: Start isEmpty. Operand 194 states and 411 transitions.
[2021-03-11 11:25:15,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-03-11 11:25:15,465 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:15,465 INFO  L519         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]
[2021-03-11 11:25:15,465 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-03-11 11:25:15,465 INFO  L428      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:15,466 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:15,466 INFO  L82        PathProgramCache]: Analyzing trace with hash -837930064, now seen corresponding path program 6 times
[2021-03-11 11:25:15,466 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:15,466 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377212896]
[2021-03-11 11:25:15,466 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:15,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-03-11 11:25:15,545 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,545 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16
[2021-03-11 11:25:15,552 INFO  L142       QuantifierPusher]: treesize reduction 12, result has 83.8 percent of original size
[2021-03-11 11:25:15,553 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62
[2021-03-11 11:25:15,577 INFO  L142       QuantifierPusher]: treesize reduction 12, result has 84.4 percent of original size
[2021-03-11 11:25:15,583 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65
[2021-03-11 11:25:15,610 INFO  L142       QuantifierPusher]: treesize reduction 19, result has 69.8 percent of original size
[2021-03-11 11:25:15,610 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44
[2021-03-11 11:25:15,633 INFO  L142       QuantifierPusher]: treesize reduction 4, result has 91.1 percent of original size
[2021-03-11 11:25:15,633 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41
[2021-03-11 11:25:15,656 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,657 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32
[2021-03-11 11:25:15,675 INFO  L142       QuantifierPusher]: treesize reduction 22, result has 52.2 percent of original size
[2021-03-11 11:25:15,675 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24
[2021-03-11 11:25:15,691 INFO  L142       QuantifierPusher]: treesize reduction 6, result has 92.7 percent of original size
[2021-03-11 11:25:15,692 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76
[2021-03-11 11:25:15,726 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,726 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18
[2021-03-11 11:25:15,739 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,740 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18
[2021-03-11 11:25:15,740 INFO  L142       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size
[2021-03-11 11:25:15,741 INFO  L147       QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9
[2021-03-11 11:25:15,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-03-11 11:25:15,751 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377212896]
[2021-03-11 11:25:15,752 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-03-11 11:25:15,752 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-03-11 11:25:15,752 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674312957]
[2021-03-11 11:25:15,753 INFO  L460      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-03-11 11:25:15,753 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-03-11 11:25:15,753 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-03-11 11:25:15,753 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2021-03-11 11:25:15,754 INFO  L87              Difference]: Start difference. First operand 194 states and 411 transitions. Second operand  has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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)
[2021-03-11 11:25:16,668 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-03-11 11:25:16,669 INFO  L93              Difference]: Finished difference Result 305 states and 625 transitions.
[2021-03-11 11:25:16,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-03-11 11:25:16,669 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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 23
[2021-03-11 11:25:16,669 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-03-11 11:25:16,670 INFO  L225             Difference]: With dead ends: 305
[2021-03-11 11:25:16,670 INFO  L226             Difference]: Without dead ends: 149
[2021-03-11 11:25:16,670 INFO  L775         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 753.1ms TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506
[2021-03-11 11:25:16,670 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2021-03-11 11:25:16,674 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 114.
[2021-03-11 11:25:16,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 113 states have (on average 1.9115044247787611) internal successors, (216), 113 states have internal predecessors, (216), 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)
[2021-03-11 11:25:16,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 216 transitions.
[2021-03-11 11:25:16,675 INFO  L78                 Accepts]: Start accepts. Automaton has 114 states and 216 transitions. Word has length 23
[2021-03-11 11:25:16,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-03-11 11:25:16,675 INFO  L480      AbstractCegarLoop]: Abstraction has 114 states and 216 transitions.
[2021-03-11 11:25:16,675 INFO  L481      AbstractCegarLoop]: Interpolant automaton has  has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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)
[2021-03-11 11:25:16,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 114 states and 216 transitions.
[2021-03-11 11:25:16,675 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-03-11 11:25:16,675 INFO  L511         BasicCegarLoop]: Found error trace
[2021-03-11 11:25:16,675 INFO  L519         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]
[2021-03-11 11:25:16,675 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-03-11 11:25:16,675 INFO  L428      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-03-11 11:25:16,676 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-03-11 11:25:16,676 INFO  L82        PathProgramCache]: Analyzing trace with hash 1378029846, now seen corresponding path program 7 times
[2021-03-11 11:25:16,676 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-03-11 11:25:16,676 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461290861]
[2021-03-11 11:25:16,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-03-11 11:25:16,711 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-11 11:25:16,711 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-11 11:25:16,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-03-11 11:25:16,754 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-03-11 11:25:16,777 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-03-11 11:25:16,777 INFO  L620         BasicCegarLoop]: Counterexample might be feasible
[2021-03-11 11:25:16,777 WARN  L517      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-03-11 11:25:16,827 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:25:16 BasicIcfg
[2021-03-11 11:25:16,827 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-03-11 11:25:16,828 INFO  L168              Benchmark]: Toolchain (without parser) took 17076.48 ms. Allocated memory was 356.5 MB in the beginning and 765.5 MB in the end (delta: 408.9 MB). Free memory was 319.3 MB in the beginning and 553.7 MB in the end (delta: -234.4 MB). Peak memory consumption was 175.9 MB. Max. memory is 16.0 GB.
[2021-03-11 11:25:16,828 INFO  L168              Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 356.5 MB. Free memory is still 337.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-03-11 11:25:16,828 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 415.06 ms. Allocated memory is still 356.5 MB. Free memory was 318.7 MB in the beginning and 312.3 MB in the end (delta: 6.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB.
[2021-03-11 11:25:16,828 INFO  L168              Benchmark]: Boogie Procedure Inliner took 35.95 ms. Allocated memory is still 356.5 MB. Free memory was 312.3 MB in the beginning and 309.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-03-11 11:25:16,828 INFO  L168              Benchmark]: Boogie Preprocessor took 25.16 ms. Allocated memory is still 356.5 MB. Free memory was 309.1 MB in the beginning and 307.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-03-11 11:25:16,828 INFO  L168              Benchmark]: RCFGBuilder took 2536.71 ms. Allocated memory was 356.5 MB in the beginning and 438.3 MB in the end (delta: 81.8 MB). Free memory was 306.0 MB in the beginning and 276.3 MB in the end (delta: 29.7 MB). Peak memory consumption was 166.0 MB. Max. memory is 16.0 GB.
[2021-03-11 11:25:16,828 INFO  L168              Benchmark]: TraceAbstraction took 14055.27 ms. Allocated memory was 438.3 MB in the beginning and 765.5 MB in the end (delta: 327.2 MB). Free memory was 276.3 MB in the beginning and 553.7 MB in the end (delta: -277.4 MB). Peak memory consumption was 50.8 MB. Max. memory is 16.0 GB.
[2021-03-11 11:25:16,829 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.10 ms. Allocated memory is still 356.5 MB. Free memory is still 337.6 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 415.06 ms. Allocated memory is still 356.5 MB. Free memory was 318.7 MB in the beginning and 312.3 MB in the end (delta: 6.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 35.95 ms. Allocated memory is still 356.5 MB. Free memory was 312.3 MB in the beginning and 309.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 25.16 ms. Allocated memory is still 356.5 MB. Free memory was 309.1 MB in the beginning and 307.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 2536.71 ms. Allocated memory was 356.5 MB in the beginning and 438.3 MB in the end (delta: 81.8 MB). Free memory was 306.0 MB in the beginning and 276.3 MB in the end (delta: 29.7 MB). Peak memory consumption was 166.0 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 14055.27 ms. Allocated memory was 438.3 MB in the beginning and 765.5 MB in the end (delta: 327.2 MB). Free memory was 276.3 MB in the beginning and 553.7 MB in the end (delta: -277.4 MB). Peak memory consumption was 50.8 MB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 7462.8ms, 107 PlacesBefore, 38 PlacesAfterwards, 99 TransitionsBefore, 29 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 4816 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1991, positive: 1840, positive conditional: 0, positive unconditional: 1840, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1084, positive: 1046, positive conditional: 0, positive unconditional: 1046, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1084, positive: 1018, positive conditional: 0, positive unconditional: 1018, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 589, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 529, negative conditional: 0, negative unconditional: 529, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 1991, positive: 794, positive conditional: 0, positive unconditional: 794, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 1084, unknown conditional: 0, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p2_EAX = 0;
[L716]               0  int __unbuffered_p2_EBX = 0;
[L717]               0  _Bool main$tmp_guard0;
[L718]               0  _Bool main$tmp_guard1;
[L720]               0  int x = 0;
[L722]               0  int y = 0;
[L723]               0  _Bool y$flush_delayed;
[L724]               0  int y$mem_tmp;
[L725]               0  _Bool y$r_buff0_thd0;
[L726]               0  _Bool y$r_buff0_thd1;
[L727]               0  _Bool y$r_buff0_thd2;
[L728]               0  _Bool y$r_buff0_thd3;
[L729]               0  _Bool y$r_buff1_thd0;
[L730]               0  _Bool y$r_buff1_thd1;
[L731]               0  _Bool y$r_buff1_thd2;
[L732]               0  _Bool y$r_buff1_thd3;
[L733]               0  _Bool y$read_delayed;
[L734]               0  int *y$read_delayed_var;
[L735]               0  int y$w_buff0;
[L736]               0  _Bool y$w_buff0_used;
[L737]               0  int y$w_buff1;
[L738]               0  _Bool y$w_buff1_used;
[L739]               0  _Bool weak$$choice0;
[L740]               0  _Bool weak$$choice2;
[L854]               0  pthread_t t2333;
[L855]  FCALL, FORK  0  pthread_create(&t2333, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L856]               0  pthread_t t2334;
[L857]  FCALL, FORK  0  pthread_create(&t2334, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L784]               2  y$w_buff1 = y$w_buff0
[L785]               2  y$w_buff0 = 2
[L786]               2  y$w_buff1_used = y$w_buff0_used
[L787]               2  y$w_buff0_used = (_Bool)1
[L19]   COND FALSE   2  !(!expression)
[L789]               2  y$r_buff1_thd0 = y$r_buff0_thd0
[L790]               2  y$r_buff1_thd1 = y$r_buff0_thd1
[L791]               2  y$r_buff1_thd2 = y$r_buff0_thd2
[L792]               2  y$r_buff1_thd3 = y$r_buff0_thd3
[L793]               2  y$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L796]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L858]               0  pthread_t t2335;
[L859]  FCALL, FORK  0  pthread_create(&t2335, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L813]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L816]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L817]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L818]               3  y$flush_delayed = weak$$choice2
[L819]               3  y$mem_tmp = y
[L820]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L820]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L821]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L821]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L822]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L822]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L823]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L823]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L824]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L824]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L825]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L825]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L826]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L826]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L827]               3  __unbuffered_p2_EBX = y
[L828]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L828]               3  y = y$flush_delayed ? y$mem_tmp : y
[L829]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L744]               1  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L747]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L747]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L748]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L748]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L749]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L749]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L750]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L750]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L751]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L751]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L832]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L833]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L833]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L834]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L834]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L835]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L835]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L836]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L836]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L839]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L841]               3  return 0;
[L754]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L755]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L756]               1  y$flush_delayed = weak$$choice2
[L757]               1  y$mem_tmp = y
[L758]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L758]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L759]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)
[L759]  EXPR         1  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L759]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L760]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L760]  EXPR         1  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L760]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L761]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)
[L761]  EXPR         1  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L761]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L762]  EXPR         1  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L762]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L763]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)
[L763]  EXPR         1  weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L763]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L764]  EXPR         1  weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L764]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  __unbuffered_p0_EAX = y
[L766]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L766]               1  y = y$flush_delayed ? y$mem_tmp : y
[L767]               1  y$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L799]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L799]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L800]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L800]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L801]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L801]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L802]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L802]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L803]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L803]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L806]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L808]               2  return 0;
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]  EXPR         1  y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y
[L770]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L770]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L771]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L771]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L772]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L772]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L773]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L773]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L774]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L774]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L777]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L779]               1  return 0;
[L861]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L4]    COND FALSE   0  !(!cond)
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L865]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L866]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L867]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L867]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L868]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L868]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L869]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L869]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L872]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L873]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L874]               0  y$flush_delayed = weak$$choice2
[L875]               0  y$mem_tmp = y
[L876]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L876]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L877]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L877]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L878]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L878]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L878]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L878]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L879]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L879]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L879]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L879]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L880]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L880]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L881]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L881]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L881]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L882]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L882]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L883]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L884]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L884]               0  y = y$flush_delayed ? y$mem_tmp : y
[L885]               0  y$flush_delayed = (_Bool)0
[L19]   COND TRUE    0  !expression
[L19]                0  reach_error()
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13869.3ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 17.0ms, AutomataDifference: 3340.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7534.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 428 SDtfs, 806 SDslu, 1386 SDs, 0 SdLazy, 1284 SolverSat, 407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1637.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2040.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1166occurred in iteration=0, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 169.7ms AutomataMinimizationTime, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 52.9ms SsaConstructionTime, 761.9ms SatisfiabilityAnalysisTime, 1730.1ms InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 2627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...