/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-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i


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


This is Ultimate 0.2.2-dev-bf34d27
[2022-01-19 05:00:15,216 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-01-19 05:00:15,218 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-01-19 05:00:15,237 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-01-19 05:00:15,238 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-01-19 05:00:15,238 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-01-19 05:00:15,239 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-01-19 05:00:15,240 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-01-19 05:00:15,242 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-01-19 05:00:15,242 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-01-19 05:00:15,243 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-01-19 05:00:15,243 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-01-19 05:00:15,244 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-01-19 05:00:15,270 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-01-19 05:00:15,270 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-01-19 05:00:15,271 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-01-19 05:00:15,271 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-01-19 05:00:15,272 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-01-19 05:00:15,273 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-01-19 05:00:15,274 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-01-19 05:00:15,275 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-01-19 05:00:15,276 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-01-19 05:00:15,276 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-01-19 05:00:15,277 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-01-19 05:00:15,278 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-01-19 05:00:15,279 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-01-19 05:00:15,279 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-01-19 05:00:15,279 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-01-19 05:00:15,279 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-01-19 05:00:15,280 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-01-19 05:00:15,280 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-01-19 05:00:15,281 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-01-19 05:00:15,281 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-01-19 05:00:15,281 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-01-19 05:00:15,282 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-01-19 05:00:15,282 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-01-19 05:00:15,283 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-01-19 05:00:15,283 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-01-19 05:00:15,283 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-01-19 05:00:15,283 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-01-19 05:00:15,284 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-01-19 05:00:15,290 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-PN-NoLbe-Before.epf
[2022-01-19 05:00:15,303 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-01-19 05:00:15,305 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-01-19 05:00:15,305 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-01-19 05:00:15,306 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-01-19 05:00:15,306 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-01-19 05:00:15,306 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-01-19 05:00:15,306 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-01-19 05:00:15,306 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-01-19 05:00:15,306 INFO  L138        SettingsManager]:  * sizeof long=4
[2022-01-19 05:00:15,306 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-01-19 05:00:15,306 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * sizeof long double=12
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2022-01-19 05:00:15,307 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2022-01-19 05:00:15,307 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2022-01-19 05:00:15,308 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-01-19 05:00:15,308 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-01-19 05:00:15,308 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2022-01-19 05:00:15,308 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-01-19 05:00:15,308 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-01-19 05:00:15,308 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-01-19 05:00:15,308 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2022-01-19 05:00:15,308 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2022-01-19 05:00:15,308 INFO  L138        SettingsManager]:  * When to check the insufficient erros location relative to the other error locations=BEFORE
[2022-01-19 05:00:15,308 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
[2022-01-19 05:00:15,472 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-01-19 05:00:15,495 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-01-19 05:00:15,497 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-01-19 05:00:15,497 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-01-19 05:00:15,498 INFO  L275        PluginConnector]: CDTParser initialized
[2022-01-19 05:00:15,499 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2022-01-19 05:00:15,539 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482ad4d5a/ee1685bdb4594d10ae1784a9a3cd9782/FLAG7ceebfab9
[2022-01-19 05:00:15,992 INFO  L306              CDTParser]: Found 1 translation units.
[2022-01-19 05:00:15,992 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2022-01-19 05:00:16,002 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482ad4d5a/ee1685bdb4594d10ae1784a9a3cd9782/FLAG7ceebfab9
[2022-01-19 05:00:16,011 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482ad4d5a/ee1685bdb4594d10ae1784a9a3cd9782
[2022-01-19 05:00:16,013 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-01-19 05:00:16,016 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2022-01-19 05:00:16,018 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-01-19 05:00:16,018 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-01-19 05:00:16,020 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-01-19 05:00:16,021 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,021 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c241d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16, skipping insertion in model container
[2022-01-19 05:00:16,021 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,025 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-01-19 05:00:16,065 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-01-19 05:00:16,193 WARN  L230   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_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052]
[2022-01-19 05:00:16,366 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-01-19 05:00:16,371 INFO  L203         MainTranslator]: Completed pre-run
[2022-01-19 05:00:16,389 WARN  L230   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_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052]
[2022-01-19 05:00:16,421 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-01-19 05:00:16,458 INFO  L208         MainTranslator]: Completed translation
[2022-01-19 05:00:16,459 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16 WrapperNode
[2022-01-19 05:00:16,459 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-01-19 05:00:16,459 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-01-19 05:00:16,460 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-01-19 05:00:16,460 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-01-19 05:00:16,464 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,477 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,500 INFO  L137                Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 275
[2022-01-19 05:00:16,500 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-01-19 05:00:16,504 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-01-19 05:00:16,504 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-01-19 05:00:16,505 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-01-19 05:00:16,510 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,510 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,514 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,515 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,531 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,536 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,539 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,562 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-01-19 05:00:16,562 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-01-19 05:00:16,562 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-01-19 05:00:16,563 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-01-19 05:00:16,563 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (1/1) ...
[2022-01-19 05:00:16,573 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-01-19 05:00:16,585 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-01-19 05:00:16,594 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-01-19 05:00:16,613 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-01-19 05:00:16,624 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2022-01-19 05:00:16,624 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-01-19 05:00:16,624 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-01-19 05:00:16,624 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-01-19 05:00:16,625 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-01-19 05:00:16,625 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2022-01-19 05:00:16,625 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2022-01-19 05:00:16,625 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2022-01-19 05:00:16,625 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2022-01-19 05:00:16,626 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2022-01-19 05:00:16,626 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2022-01-19 05:00:16,626 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2022-01-19 05:00:16,627 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-01-19 05:00:16,627 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-01-19 05:00:16,627 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-01-19 05:00:16,628 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-01-19 05:00:16,759 INFO  L234             CfgBuilder]: Building ICFG
[2022-01-19 05:00:16,760 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-01-19 05:00:17,309 INFO  L275             CfgBuilder]: Performing block encoding
[2022-01-19 05:00:17,697 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-01-19 05:00:17,697 INFO  L299             CfgBuilder]: Removed 0 assume(true) statements.
[2022-01-19 05:00:17,700 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:00:17 BoogieIcfgContainer
[2022-01-19 05:00:17,700 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-01-19 05:00:17,702 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-01-19 05:00:17,702 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2022-01-19 05:00:17,704 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2022-01-19 05:00:17,704 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 05:00:16" (1/3) ...
[2022-01-19 05:00:17,704 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18162407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:00:17, skipping insertion in model container
[2022-01-19 05:00:17,705 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 05:00:16" (2/3) ...
[2022-01-19 05:00:17,705 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18162407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 05:00:17, skipping insertion in model container
[2022-01-19 05:00:17,705 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 05:00:17" (3/3) ...
[2022-01-19 05:00:17,706 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2022-01-19 05:00:17,710 INFO  L205   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-01-19 05:00:17,710 INFO  L164   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2022-01-19 05:00:17,710 INFO  L534   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-01-19 05:00:17,755 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,756 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,756 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,756 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,756 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,756 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,756 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,756 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,757 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,757 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,757 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,757 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,757 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,758 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,758 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,758 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,758 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,758 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,759 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,759 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,759 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,759 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,760 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,760 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,760 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,761 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,761 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,761 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,762 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,763 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,764 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,766 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,766 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,766 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,766 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,766 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,767 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,768 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,769 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,769 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,770 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,770 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,770 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,771 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,772 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,776 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,776 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,776 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,776 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,776 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,776 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,778 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,778 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,778 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,778 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,779 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,779 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,779 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,779 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,779 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,779 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,780 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,780 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,780 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,780 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,780 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,780 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,780 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,780 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,781 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,782 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,782 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,782 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,782 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,782 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,782 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,782 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,783 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,783 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,783 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,783 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,783 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,783 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,783 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,783 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,784 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,784 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,784 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,784 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,784 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,784 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,785 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,785 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,785 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,785 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,785 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,785 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,785 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,786 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,786 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,786 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,787 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,787 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,787 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,787 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,787 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,787 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,788 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,789 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,790 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,790 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,790 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,790 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,790 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,798 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,799 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,800 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,802 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,803 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,804 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,804 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,805 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,810 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,810 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,810 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,810 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,810 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,810 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,810 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,811 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,811 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,811 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,811 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,811 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,811 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,811 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,811 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,812 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,812 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,815 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,816 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,817 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,817 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,817 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,817 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,817 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,817 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,818 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,819 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,820 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,821 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,822 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2022-01-19 05:00:17,823 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2022-01-19 05:00:17,864 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-01-19 05:00:17,869 INFO  L339      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2022-01-19 05:00:17,869 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2022-01-19 05:00:17,878 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow
[2022-01-19 05:00:17,916 INFO  L129       PetriNetUnfolder]: 2/113 cut-off events.
[2022-01-19 05:00:17,916 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-01-19 05:00:17,920 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. 
[2022-01-19 05:00:17,920 INFO  L82        GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow
[2022-01-19 05:00:17,924 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow
[2022-01-19 05:00:17,939 INFO  L129       PetriNetUnfolder]: 0/61 cut-off events.
[2022-01-19 05:00:17,939 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-01-19 05:00:17,939 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:17,940 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:17,940 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:17,944 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:17,944 INFO  L85        PathProgramCache]: Analyzing trace with hash -16800889, now seen corresponding path program 1 times
[2022-01-19 05:00:17,951 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:17,951 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275699142]
[2022-01-19 05:00:17,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:17,952 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:18,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:18,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:18,195 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:18,195 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275699142]
[2022-01-19 05:00:18,195 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275699142] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:18,195 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:18,196 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-01-19 05:00:18,197 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789578146]
[2022-01-19 05:00:18,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:18,202 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-01-19 05:00:18,203 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:18,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-01-19 05:00:18,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-01-19 05:00:18,260 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 116
[2022-01-19 05:00:18,263 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 113 transitions, 235 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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)
[2022-01-19 05:00:18,263 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:18,263 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 116
[2022-01-19 05:00:18,264 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:18,593 INFO  L129       PetriNetUnfolder]: 210/818 cut-off events.
[2022-01-19 05:00:18,593 INFO  L130       PetriNetUnfolder]: For 17/17 co-relation queries the response was YES.
[2022-01-19 05:00:18,597 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 818 events. 210/818 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5120 event pairs, 46 based on Foata normal form. 39/810 useless extension candidates. Maximal degree in co-relation 1140. Up to 245 conditions per place. 
[2022-01-19 05:00:18,601 INFO  L132   encePairwiseOnDemand]: 111/116 looper letters, 19 selfloop transitions, 2 changer transitions 0/117 dead transitions.
[2022-01-19 05:00:18,601 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 288 flow
[2022-01-19 05:00:18,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-01-19 05:00:18,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-01-19 05:00:18,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions.
[2022-01-19 05:00:18,610 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9281609195402298
[2022-01-19 05:00:18,611 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 323 transitions.
[2022-01-19 05:00:18,611 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions.
[2022-01-19 05:00:18,620 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:18,621 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions.
[2022-01-19 05:00:18,625 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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)
[2022-01-19 05:00:18,630 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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)
[2022-01-19 05:00:18,630 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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)
[2022-01-19 05:00:18,632 INFO  L186             Difference]: Start difference. First operand has 121 places, 113 transitions, 235 flow. Second operand 3 states and 323 transitions.
[2022-01-19 05:00:18,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 288 flow
[2022-01-19 05:00:18,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 117 transitions, 284 flow, removed 0 selfloop flow, removed 3 redundant places.
[2022-01-19 05:00:18,640 INFO  L242             Difference]: Finished difference. Result has 118 places, 109 transitions, 228 flow
[2022-01-19 05:00:18,641 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=118, PETRI_TRANSITIONS=109}
[2022-01-19 05:00:18,645 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places.
[2022-01-19 05:00:18,645 INFO  L470      AbstractCegarLoop]: Abstraction has has 118 places, 109 transitions, 228 flow
[2022-01-19 05:00:18,645 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 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)
[2022-01-19 05:00:18,645 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:18,646 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:18,646 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-01-19 05:00:18,646 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:18,646 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:18,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 659796401, now seen corresponding path program 1 times
[2022-01-19 05:00:18,646 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:18,646 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132730812]
[2022-01-19 05:00:18,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:18,647 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:18,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:18,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:18,821 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:18,821 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132730812]
[2022-01-19 05:00:18,821 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132730812] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:18,821 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:18,821 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-01-19 05:00:18,821 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861138159]
[2022-01-19 05:00:18,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:18,822 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-01-19 05:00:18,823 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:18,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-01-19 05:00:18,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-01-19 05:00:18,826 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 116
[2022-01-19 05:00:18,826 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 109 transitions, 228 flow. Second operand  has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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)
[2022-01-19 05:00:18,826 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:18,828 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 116
[2022-01-19 05:00:18,829 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:19,280 INFO  L129       PetriNetUnfolder]: 690/1888 cut-off events.
[2022-01-19 05:00:19,280 INFO  L130       PetriNetUnfolder]: For 124/124 co-relation queries the response was YES.
[2022-01-19 05:00:19,285 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 1888 events. 690/1888 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13603 event pairs, 312 based on Foata normal form. 0/1820 useless extension candidates. Maximal degree in co-relation 3066. Up to 429 conditions per place. 
[2022-01-19 05:00:19,290 INFO  L132   encePairwiseOnDemand]: 110/116 looper letters, 23 selfloop transitions, 2 changer transitions 54/158 dead transitions.
[2022-01-19 05:00:19,290 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 158 transitions, 480 flow
[2022-01-19 05:00:19,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-01-19 05:00:19,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-01-19 05:00:19,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 907 transitions.
[2022-01-19 05:00:19,296 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8687739463601533
[2022-01-19 05:00:19,296 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 907 transitions.
[2022-01-19 05:00:19,296 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 907 transitions.
[2022-01-19 05:00:19,296 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:19,296 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 907 transitions.
[2022-01-19 05:00:19,298 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 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)
[2022-01-19 05:00:19,300 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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)
[2022-01-19 05:00:19,301 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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)
[2022-01-19 05:00:19,301 INFO  L186             Difference]: Start difference. First operand has 118 places, 109 transitions, 228 flow. Second operand 9 states and 907 transitions.
[2022-01-19 05:00:19,301 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 158 transitions, 480 flow
[2022-01-19 05:00:19,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 158 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places.
[2022-01-19 05:00:19,306 INFO  L242             Difference]: Finished difference. Result has 131 places, 97 transitions, 220 flow
[2022-01-19 05:00:19,306 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=131, PETRI_TRANSITIONS=97}
[2022-01-19 05:00:19,307 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2022-01-19 05:00:19,307 INFO  L470      AbstractCegarLoop]: Abstraction has has 131 places, 97 transitions, 220 flow
[2022-01-19 05:00:19,308 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 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)
[2022-01-19 05:00:19,308 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:19,308 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:19,308 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-01-19 05:00:19,308 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:19,308 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:19,309 INFO  L85        PathProgramCache]: Analyzing trace with hash -726916817, now seen corresponding path program 1 times
[2022-01-19 05:00:19,309 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:19,309 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106743368]
[2022-01-19 05:00:19,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:19,309 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:19,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:19,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:19,541 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:19,541 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106743368]
[2022-01-19 05:00:19,541 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106743368] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:19,541 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:19,541 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-01-19 05:00:19,541 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425013478]
[2022-01-19 05:00:19,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:19,542 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-01-19 05:00:19,542 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:19,542 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-01-19 05:00:19,542 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-01-19 05:00:19,543 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 116
[2022-01-19 05:00:19,544 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 97 transitions, 220 flow. Second operand  has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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)
[2022-01-19 05:00:19,544 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:19,544 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 116
[2022-01-19 05:00:19,544 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:19,821 INFO  L129       PetriNetUnfolder]: 512/1064 cut-off events.
[2022-01-19 05:00:19,821 INFO  L130       PetriNetUnfolder]: For 256/256 co-relation queries the response was YES.
[2022-01-19 05:00:19,823 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 1064 events. 512/1064 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5693 event pairs, 103 based on Foata normal form. 24/1042 useless extension candidates. Maximal degree in co-relation 2146. Up to 466 conditions per place. 
[2022-01-19 05:00:19,826 INFO  L132   encePairwiseOnDemand]: 110/116 looper letters, 23 selfloop transitions, 2 changer transitions 34/137 dead transitions.
[2022-01-19 05:00:19,826 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 137 transitions, 439 flow
[2022-01-19 05:00:19,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-01-19 05:00:19,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-01-19 05:00:19,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 889 transitions.
[2022-01-19 05:00:19,828 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8515325670498084
[2022-01-19 05:00:19,828 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 889 transitions.
[2022-01-19 05:00:19,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 889 transitions.
[2022-01-19 05:00:19,829 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:19,829 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 889 transitions.
[2022-01-19 05:00:19,830 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 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)
[2022-01-19 05:00:19,832 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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)
[2022-01-19 05:00:19,832 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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)
[2022-01-19 05:00:19,832 INFO  L186             Difference]: Start difference. First operand has 131 places, 97 transitions, 220 flow. Second operand 9 states and 889 transitions.
[2022-01-19 05:00:19,832 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 137 transitions, 439 flow
[2022-01-19 05:00:19,836 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 137 transitions, 405 flow, removed 14 selfloop flow, removed 8 redundant places.
[2022-01-19 05:00:19,837 INFO  L242             Difference]: Finished difference. Result has 120 places, 97 transitions, 224 flow
[2022-01-19 05:00:19,837 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=224, PETRI_PLACES=120, PETRI_TRANSITIONS=97}
[2022-01-19 05:00:19,838 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, -1 predicate places.
[2022-01-19 05:00:19,838 INFO  L470      AbstractCegarLoop]: Abstraction has has 120 places, 97 transitions, 224 flow
[2022-01-19 05:00:19,838 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 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)
[2022-01-19 05:00:19,838 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:19,839 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:19,839 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-01-19 05:00:19,839 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:19,839 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:19,839 INFO  L85        PathProgramCache]: Analyzing trace with hash -74082386, now seen corresponding path program 1 times
[2022-01-19 05:00:19,839 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:19,839 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076576237]
[2022-01-19 05:00:19,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:19,840 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:19,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:20,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:20,022 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:20,023 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076576237]
[2022-01-19 05:00:20,023 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076576237] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:20,023 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:20,023 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-01-19 05:00:20,023 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879183372]
[2022-01-19 05:00:20,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:20,024 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-01-19 05:00:20,025 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:20,025 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-01-19 05:00:20,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2022-01-19 05:00:20,028 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 116
[2022-01-19 05:00:20,029 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 97 transitions, 224 flow. Second operand  has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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)
[2022-01-19 05:00:20,029 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:20,029 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 116
[2022-01-19 05:00:20,029 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:20,406 INFO  L129       PetriNetUnfolder]: 604/1340 cut-off events.
[2022-01-19 05:00:20,406 INFO  L130       PetriNetUnfolder]: For 293/293 co-relation queries the response was YES.
[2022-01-19 05:00:20,409 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 1340 events. 604/1340 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7879 event pairs, 170 based on Foata normal form. 24/1285 useless extension candidates. Maximal degree in co-relation 2645. Up to 293 conditions per place. 
[2022-01-19 05:00:20,411 INFO  L132   encePairwiseOnDemand]: 108/116 looper letters, 27 selfloop transitions, 4 changer transitions 40/147 dead transitions.
[2022-01-19 05:00:20,411 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 147 transitions, 497 flow
[2022-01-19 05:00:20,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-01-19 05:00:20,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-01-19 05:00:20,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions.
[2022-01-19 05:00:20,414 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8387931034482758
[2022-01-19 05:00:20,414 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 973 transitions.
[2022-01-19 05:00:20,414 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 973 transitions.
[2022-01-19 05:00:20,414 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:20,414 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 973 transitions.
[2022-01-19 05:00:20,416 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.3) internal successors, (973), 10 states have internal predecessors, (973), 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)
[2022-01-19 05:00:20,417 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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)
[2022-01-19 05:00:20,418 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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)
[2022-01-19 05:00:20,418 INFO  L186             Difference]: Start difference. First operand has 120 places, 97 transitions, 224 flow. Second operand 10 states and 973 transitions.
[2022-01-19 05:00:20,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 147 transitions, 497 flow
[2022-01-19 05:00:20,421 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 147 transitions, 463 flow, removed 14 selfloop flow, removed 8 redundant places.
[2022-01-19 05:00:20,422 INFO  L242             Difference]: Finished difference. Result has 123 places, 97 transitions, 238 flow
[2022-01-19 05:00:20,423 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=238, PETRI_PLACES=123, PETRI_TRANSITIONS=97}
[2022-01-19 05:00:20,423 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 2 predicate places.
[2022-01-19 05:00:20,423 INFO  L470      AbstractCegarLoop]: Abstraction has has 123 places, 97 transitions, 238 flow
[2022-01-19 05:00:20,424 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 92.14285714285714) internal successors, (645), 7 states have internal predecessors, (645), 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)
[2022-01-19 05:00:20,424 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:20,424 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:20,424 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-01-19 05:00:20,424 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:20,424 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:20,424 INFO  L85        PathProgramCache]: Analyzing trace with hash -1217105744, now seen corresponding path program 1 times
[2022-01-19 05:00:20,424 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:20,425 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501262591]
[2022-01-19 05:00:20,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:20,425 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:20,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:20,676 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:20,676 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:20,676 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501262591]
[2022-01-19 05:00:20,676 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501262591] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:20,676 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:20,676 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-01-19 05:00:20,677 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691937825]
[2022-01-19 05:00:20,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:20,677 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-01-19 05:00:20,677 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:20,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-01-19 05:00:20,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2022-01-19 05:00:20,678 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116
[2022-01-19 05:00:20,679 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 97 transitions, 238 flow. Second operand  has 13 states, 13 states have (on average 87.61538461538461) internal successors, (1139), 13 states have internal predecessors, (1139), 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)
[2022-01-19 05:00:20,679 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:20,679 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116
[2022-01-19 05:00:20,679 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:21,341 INFO  L129       PetriNetUnfolder]: 548/1335 cut-off events.
[2022-01-19 05:00:21,341 INFO  L130       PetriNetUnfolder]: For 540/546 co-relation queries the response was YES.
[2022-01-19 05:00:21,344 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 1335 events. 548/1335 cut-off events. For 540/546 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7980 event pairs, 132 based on Foata normal form. 34/1281 useless extension candidates. Maximal degree in co-relation 2685. Up to 408 conditions per place. 
[2022-01-19 05:00:21,347 INFO  L132   encePairwiseOnDemand]: 103/116 looper letters, 33 selfloop transitions, 12 changer transitions 47/164 dead transitions.
[2022-01-19 05:00:21,347 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 164 transitions, 604 flow
[2022-01-19 05:00:21,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2022-01-19 05:00:21,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2022-01-19 05:00:21,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1557 transitions.
[2022-01-19 05:00:21,350 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.789553752535497
[2022-01-19 05:00:21,350 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1557 transitions.
[2022-01-19 05:00:21,350 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1557 transitions.
[2022-01-19 05:00:21,351 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:21,351 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1557 transitions.
[2022-01-19 05:00:21,354 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 91.58823529411765) internal successors, (1557), 17 states have internal predecessors, (1557), 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)
[2022-01-19 05:00:21,356 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 116.0) internal successors, (2088), 18 states have internal predecessors, (2088), 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)
[2022-01-19 05:00:21,356 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 116.0) internal successors, (2088), 18 states have internal predecessors, (2088), 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)
[2022-01-19 05:00:21,356 INFO  L186             Difference]: Start difference. First operand has 123 places, 97 transitions, 238 flow. Second operand 17 states and 1557 transitions.
[2022-01-19 05:00:21,357 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 164 transitions, 604 flow
[2022-01-19 05:00:21,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 164 transitions, 546 flow, removed 24 selfloop flow, removed 10 redundant places.
[2022-01-19 05:00:21,362 INFO  L242             Difference]: Finished difference. Result has 135 places, 105 transitions, 302 flow
[2022-01-19 05:00:21,362 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=302, PETRI_PLACES=135, PETRI_TRANSITIONS=105}
[2022-01-19 05:00:21,363 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places.
[2022-01-19 05:00:21,363 INFO  L470      AbstractCegarLoop]: Abstraction has has 135 places, 105 transitions, 302 flow
[2022-01-19 05:00:21,363 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.61538461538461) internal successors, (1139), 13 states have internal predecessors, (1139), 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)
[2022-01-19 05:00:21,363 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:21,364 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:21,364 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-01-19 05:00:21,364 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:21,364 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:21,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -1919193934, now seen corresponding path program 2 times
[2022-01-19 05:00:21,364 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:21,364 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381294928]
[2022-01-19 05:00:21,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:21,365 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:21,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:21,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:21,566 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:21,566 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381294928]
[2022-01-19 05:00:21,567 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381294928] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:21,567 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:21,567 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-01-19 05:00:21,567 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800529530]
[2022-01-19 05:00:21,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:21,567 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-01-19 05:00:21,567 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:21,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-01-19 05:00:21,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2022-01-19 05:00:21,569 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116
[2022-01-19 05:00:21,569 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 105 transitions, 302 flow. Second operand  has 13 states, 13 states have (on average 88.53846153846153) internal successors, (1151), 13 states have internal predecessors, (1151), 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)
[2022-01-19 05:00:21,569 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:21,570 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116
[2022-01-19 05:00:21,570 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:22,058 INFO  L129       PetriNetUnfolder]: 418/1088 cut-off events.
[2022-01-19 05:00:22,059 INFO  L130       PetriNetUnfolder]: For 842/917 co-relation queries the response was YES.
[2022-01-19 05:00:22,061 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2688 conditions, 1088 events. 418/1088 cut-off events. For 842/917 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6736 event pairs, 52 based on Foata normal form. 19/1043 useless extension candidates. Maximal degree in co-relation 2614. Up to 516 conditions per place. 
[2022-01-19 05:00:22,065 INFO  L132   encePairwiseOnDemand]: 99/116 looper letters, 36 selfloop transitions, 18 changer transitions 28/155 dead transitions.
[2022-01-19 05:00:22,065 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 155 transitions, 665 flow
[2022-01-19 05:00:22,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2022-01-19 05:00:22,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2022-01-19 05:00:22,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1382 transitions.
[2022-01-19 05:00:22,068 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7942528735632184
[2022-01-19 05:00:22,068 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1382 transitions.
[2022-01-19 05:00:22,068 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1382 transitions.
[2022-01-19 05:00:22,069 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:22,069 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1382 transitions.
[2022-01-19 05:00:22,071 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 92.13333333333334) internal successors, (1382), 15 states have internal predecessors, (1382), 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)
[2022-01-19 05:00:22,073 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 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)
[2022-01-19 05:00:22,073 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 116.0) internal successors, (1856), 16 states have internal predecessors, (1856), 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)
[2022-01-19 05:00:22,073 INFO  L186             Difference]: Start difference. First operand has 135 places, 105 transitions, 302 flow. Second operand 15 states and 1382 transitions.
[2022-01-19 05:00:22,073 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 155 transitions, 665 flow
[2022-01-19 05:00:22,077 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 155 transitions, 615 flow, removed 21 selfloop flow, removed 13 redundant places.
[2022-01-19 05:00:22,079 INFO  L242             Difference]: Finished difference. Result has 135 places, 116 transitions, 422 flow
[2022-01-19 05:00:22,079 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=422, PETRI_PLACES=135, PETRI_TRANSITIONS=116}
[2022-01-19 05:00:22,080 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 14 predicate places.
[2022-01-19 05:00:22,080 INFO  L470      AbstractCegarLoop]: Abstraction has has 135 places, 116 transitions, 422 flow
[2022-01-19 05:00:22,080 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 88.53846153846153) internal successors, (1151), 13 states have internal predecessors, (1151), 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)
[2022-01-19 05:00:22,080 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:22,080 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:22,080 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-01-19 05:00:22,081 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:22,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:22,081 INFO  L85        PathProgramCache]: Analyzing trace with hash 832797035, now seen corresponding path program 1 times
[2022-01-19 05:00:22,081 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:22,081 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704482512]
[2022-01-19 05:00:22,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:22,081 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:22,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:22,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:22,157 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:22,157 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704482512]
[2022-01-19 05:00:22,157 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704482512] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:22,158 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:22,158 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-01-19 05:00:22,158 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719767033]
[2022-01-19 05:00:22,158 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:22,158 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-01-19 05:00:22,158 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:22,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-01-19 05:00:22,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2022-01-19 05:00:22,159 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2022-01-19 05:00:22,159 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 116 transitions, 422 flow. Second operand  has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 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)
[2022-01-19 05:00:22,160 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:22,160 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2022-01-19 05:00:22,160 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:23,009 INFO  L129       PetriNetUnfolder]: 3299/6093 cut-off events.
[2022-01-19 05:00:23,009 INFO  L130       PetriNetUnfolder]: For 15184/15652 co-relation queries the response was YES.
[2022-01-19 05:00:23,019 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 19038 conditions, 6093 events. 3299/6093 cut-off events. For 15184/15652 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 43629 event pairs, 133 based on Foata normal form. 160/6121 useless extension candidates. Maximal degree in co-relation 18969. Up to 1722 conditions per place. 
[2022-01-19 05:00:23,033 INFO  L132   encePairwiseOnDemand]: 106/116 looper letters, 78 selfloop transitions, 6 changer transitions 137/296 dead transitions.
[2022-01-19 05:00:23,033 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 2055 flow
[2022-01-19 05:00:23,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-01-19 05:00:23,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-01-19 05:00:23,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions.
[2022-01-19 05:00:23,035 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8586206896551725
[2022-01-19 05:00:23,035 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 996 transitions.
[2022-01-19 05:00:23,035 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions.
[2022-01-19 05:00:23,036 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:23,036 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions.
[2022-01-19 05:00:23,038 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 99.6) internal successors, (996), 10 states have internal predecessors, (996), 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)
[2022-01-19 05:00:23,040 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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)
[2022-01-19 05:00:23,040 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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)
[2022-01-19 05:00:23,040 INFO  L186             Difference]: Start difference. First operand has 135 places, 116 transitions, 422 flow. Second operand 10 states and 996 transitions.
[2022-01-19 05:00:23,041 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 2055 flow
[2022-01-19 05:00:23,046 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 296 transitions, 2010 flow, removed 20 selfloop flow, removed 6 redundant places.
[2022-01-19 05:00:23,048 INFO  L242             Difference]: Finished difference. Result has 138 places, 118 transitions, 459 flow
[2022-01-19 05:00:23,048 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=459, PETRI_PLACES=138, PETRI_TRANSITIONS=118}
[2022-01-19 05:00:23,049 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 17 predicate places.
[2022-01-19 05:00:23,049 INFO  L470      AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 459 flow
[2022-01-19 05:00:23,049 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 91.66666666666667) internal successors, (550), 6 states have internal predecessors, (550), 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)
[2022-01-19 05:00:23,049 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:23,049 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:23,049 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-01-19 05:00:23,050 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:23,050 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:23,050 INFO  L85        PathProgramCache]: Analyzing trace with hash -1201426345, now seen corresponding path program 1 times
[2022-01-19 05:00:23,050 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:23,050 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849628735]
[2022-01-19 05:00:23,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:23,050 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:23,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:23,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:23,262 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:23,262 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849628735]
[2022-01-19 05:00:23,262 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849628735] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:23,262 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:23,262 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-01-19 05:00:23,262 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872871643]
[2022-01-19 05:00:23,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:23,263 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-01-19 05:00:23,263 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:23,263 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-01-19 05:00:23,263 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2022-01-19 05:00:23,264 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116
[2022-01-19 05:00:23,265 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 459 flow. Second operand  has 13 states, 13 states have (on average 87.6923076923077) internal successors, (1140), 13 states have internal predecessors, (1140), 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)
[2022-01-19 05:00:23,265 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:23,265 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116
[2022-01-19 05:00:23,265 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:23,733 INFO  L129       PetriNetUnfolder]: 535/1652 cut-off events.
[2022-01-19 05:00:23,733 INFO  L130       PetriNetUnfolder]: For 3409/3606 co-relation queries the response was YES.
[2022-01-19 05:00:23,739 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5264 conditions, 1652 events. 535/1652 cut-off events. For 3409/3606 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12398 event pairs, 206 based on Foata normal form. 7/1544 useless extension candidates. Maximal degree in co-relation 5186. Up to 584 conditions per place. 
[2022-01-19 05:00:23,745 INFO  L132   encePairwiseOnDemand]: 103/116 looper letters, 47 selfloop transitions, 15 changer transitions 22/158 dead transitions.
[2022-01-19 05:00:23,745 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 158 transitions, 932 flow
[2022-01-19 05:00:23,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-01-19 05:00:23,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2022-01-19 05:00:23,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1269 transitions.
[2022-01-19 05:00:23,748 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7814039408866995
[2022-01-19 05:00:23,748 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1269 transitions.
[2022-01-19 05:00:23,748 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1269 transitions.
[2022-01-19 05:00:23,749 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:23,749 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1269 transitions.
[2022-01-19 05:00:23,751 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 90.64285714285714) internal successors, (1269), 14 states have internal predecessors, (1269), 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)
[2022-01-19 05:00:23,752 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 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)
[2022-01-19 05:00:23,753 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 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)
[2022-01-19 05:00:23,753 INFO  L186             Difference]: Start difference. First operand has 138 places, 118 transitions, 459 flow. Second operand 14 states and 1269 transitions.
[2022-01-19 05:00:23,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 158 transitions, 932 flow
[2022-01-19 05:00:23,758 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 158 transitions, 918 flow, removed 3 selfloop flow, removed 5 redundant places.
[2022-01-19 05:00:23,759 INFO  L242             Difference]: Finished difference. Result has 148 places, 126 transitions, 582 flow
[2022-01-19 05:00:23,760 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=582, PETRI_PLACES=148, PETRI_TRANSITIONS=126}
[2022-01-19 05:00:23,760 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places.
[2022-01-19 05:00:23,760 INFO  L470      AbstractCegarLoop]: Abstraction has has 148 places, 126 transitions, 582 flow
[2022-01-19 05:00:23,761 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.6923076923077) internal successors, (1140), 13 states have internal predecessors, (1140), 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)
[2022-01-19 05:00:23,761 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:23,761 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:23,761 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-01-19 05:00:23,761 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:23,761 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:23,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 959504979, now seen corresponding path program 1 times
[2022-01-19 05:00:23,761 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:23,761 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772414511]
[2022-01-19 05:00:23,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:23,762 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:23,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:23,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:23,841 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:23,841 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772414511]
[2022-01-19 05:00:23,841 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772414511] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:23,842 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:23,842 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2022-01-19 05:00:23,842 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159144508]
[2022-01-19 05:00:23,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:23,842 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2022-01-19 05:00:23,842 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:23,842 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2022-01-19 05:00:23,842 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2022-01-19 05:00:23,843 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2022-01-19 05:00:23,843 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 126 transitions, 582 flow. Second operand  has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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)
[2022-01-19 05:00:23,843 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:23,843 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2022-01-19 05:00:23,844 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:24,313 INFO  L129       PetriNetUnfolder]: 1089/2551 cut-off events.
[2022-01-19 05:00:24,313 INFO  L130       PetriNetUnfolder]: For 10657/10848 co-relation queries the response was YES.
[2022-01-19 05:00:24,321 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 9566 conditions, 2551 events. 1089/2551 cut-off events. For 10657/10848 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17913 event pairs, 50 based on Foata normal form. 145/2677 useless extension candidates. Maximal degree in co-relation 9486. Up to 574 conditions per place. 
[2022-01-19 05:00:24,328 INFO  L132   encePairwiseOnDemand]: 107/116 looper letters, 88 selfloop transitions, 9 changer transitions 106/278 dead transitions.
[2022-01-19 05:00:24,328 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 278 transitions, 2318 flow
[2022-01-19 05:00:24,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2022-01-19 05:00:24,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2022-01-19 05:00:24,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 990 transitions.
[2022-01-19 05:00:24,330 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.853448275862069
[2022-01-19 05:00:24,330 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 990 transitions.
[2022-01-19 05:00:24,330 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 990 transitions.
[2022-01-19 05:00:24,331 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:24,331 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 990 transitions.
[2022-01-19 05:00:24,332 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 99.0) internal successors, (990), 10 states have internal predecessors, (990), 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)
[2022-01-19 05:00:24,334 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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)
[2022-01-19 05:00:24,334 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 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)
[2022-01-19 05:00:24,334 INFO  L186             Difference]: Start difference. First operand has 148 places, 126 transitions, 582 flow. Second operand 10 states and 990 transitions.
[2022-01-19 05:00:24,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 278 transitions, 2318 flow
[2022-01-19 05:00:24,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 278 transitions, 2163 flow, removed 55 selfloop flow, removed 13 redundant places.
[2022-01-19 05:00:24,343 INFO  L242             Difference]: Finished difference. Result has 144 places, 124 transitions, 582 flow
[2022-01-19 05:00:24,344 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=582, PETRI_PLACES=144, PETRI_TRANSITIONS=124}
[2022-01-19 05:00:24,344 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 23 predicate places.
[2022-01-19 05:00:24,344 INFO  L470      AbstractCegarLoop]: Abstraction has has 144 places, 124 transitions, 582 flow
[2022-01-19 05:00:24,345 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 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)
[2022-01-19 05:00:24,345 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:24,345 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:24,345 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-01-19 05:00:24,345 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:24,345 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:24,345 INFO  L85        PathProgramCache]: Analyzing trace with hash -1620102906, now seen corresponding path program 1 times
[2022-01-19 05:00:24,345 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:24,345 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149673965]
[2022-01-19 05:00:24,345 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:24,346 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:24,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:24,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:24,438 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:24,438 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149673965]
[2022-01-19 05:00:24,438 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149673965] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:24,439 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:24,439 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-01-19 05:00:24,439 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298442771]
[2022-01-19 05:00:24,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:24,440 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-01-19 05:00:24,440 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:24,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-01-19 05:00:24,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2022-01-19 05:00:24,441 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2022-01-19 05:00:24,442 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 124 transitions, 582 flow. Second operand  has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 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)
[2022-01-19 05:00:24,442 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:24,442 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2022-01-19 05:00:24,442 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:24,733 INFO  L129       PetriNetUnfolder]: 379/1139 cut-off events.
[2022-01-19 05:00:24,733 INFO  L130       PetriNetUnfolder]: For 4143/4262 co-relation queries the response was YES.
[2022-01-19 05:00:24,737 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 4328 conditions, 1139 events. 379/1139 cut-off events. For 4143/4262 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7355 event pairs, 46 based on Foata normal form. 39/1159 useless extension candidates. Maximal degree in co-relation 4261. Up to 222 conditions per place. 
[2022-01-19 05:00:24,740 INFO  L132   encePairwiseOnDemand]: 107/116 looper letters, 72 selfloop transitions, 12 changer transitions 47/206 dead transitions.
[2022-01-19 05:00:24,740 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 206 transitions, 1528 flow
[2022-01-19 05:00:24,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2022-01-19 05:00:24,741 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2022-01-19 05:00:24,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1050 transitions.
[2022-01-19 05:00:24,743 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.822884012539185
[2022-01-19 05:00:24,743 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1050 transitions.
[2022-01-19 05:00:24,743 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1050 transitions.
[2022-01-19 05:00:24,743 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:24,743 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1050 transitions.
[2022-01-19 05:00:24,745 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 95.45454545454545) internal successors, (1050), 11 states have internal predecessors, (1050), 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)
[2022-01-19 05:00:24,747 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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)
[2022-01-19 05:00:24,747 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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)
[2022-01-19 05:00:24,747 INFO  L186             Difference]: Start difference. First operand has 144 places, 124 transitions, 582 flow. Second operand 11 states and 1050 transitions.
[2022-01-19 05:00:24,747 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 206 transitions, 1528 flow
[2022-01-19 05:00:24,756 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 206 transitions, 1403 flow, removed 46 selfloop flow, removed 11 redundant places.
[2022-01-19 05:00:24,758 INFO  L242             Difference]: Finished difference. Result has 145 places, 124 transitions, 550 flow
[2022-01-19 05:00:24,758 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=550, PETRI_PLACES=145, PETRI_TRANSITIONS=124}
[2022-01-19 05:00:24,758 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 24 predicate places.
[2022-01-19 05:00:24,759 INFO  L470      AbstractCegarLoop]: Abstraction has has 145 places, 124 transitions, 550 flow
[2022-01-19 05:00:24,759 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 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)
[2022-01-19 05:00:24,759 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:24,759 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:24,759 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2022-01-19 05:00:24,759 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:24,760 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:24,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -548527530, now seen corresponding path program 1 times
[2022-01-19 05:00:24,760 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:24,760 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563118177]
[2022-01-19 05:00:24,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:24,760 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:24,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:25,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:25,030 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:25,030 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563118177]
[2022-01-19 05:00:25,030 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563118177] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:25,030 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:25,030 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-01-19 05:00:25,030 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923986558]
[2022-01-19 05:00:25,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:25,031 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-01-19 05:00:25,031 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:25,031 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-01-19 05:00:25,031 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2022-01-19 05:00:25,032 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 116
[2022-01-19 05:00:25,033 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 124 transitions, 550 flow. Second operand  has 14 states, 14 states have (on average 87.78571428571429) internal successors, (1229), 14 states have internal predecessors, (1229), 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)
[2022-01-19 05:00:25,033 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:25,033 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 116
[2022-01-19 05:00:25,033 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:25,462 INFO  L129       PetriNetUnfolder]: 167/720 cut-off events.
[2022-01-19 05:00:25,462 INFO  L130       PetriNetUnfolder]: For 1712/1806 co-relation queries the response was YES.
[2022-01-19 05:00:25,465 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2314 conditions, 720 events. 167/720 cut-off events. For 1712/1806 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4576 event pairs, 11 based on Foata normal form. 2/697 useless extension candidates. Maximal degree in co-relation 2232. Up to 130 conditions per place. 
[2022-01-19 05:00:25,467 INFO  L132   encePairwiseOnDemand]: 102/116 looper letters, 38 selfloop transitions, 17 changer transitions 21/153 dead transitions.
[2022-01-19 05:00:25,468 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 876 flow
[2022-01-19 05:00:25,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-01-19 05:00:25,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2022-01-19 05:00:25,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1266 transitions.
[2022-01-19 05:00:25,470 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7795566502463054
[2022-01-19 05:00:25,470 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1266 transitions.
[2022-01-19 05:00:25,470 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1266 transitions.
[2022-01-19 05:00:25,471 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:25,471 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1266 transitions.
[2022-01-19 05:00:25,473 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 90.42857142857143) internal successors, (1266), 14 states have internal predecessors, (1266), 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)
[2022-01-19 05:00:25,475 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 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)
[2022-01-19 05:00:25,475 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 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)
[2022-01-19 05:00:25,475 INFO  L186             Difference]: Start difference. First operand has 145 places, 124 transitions, 550 flow. Second operand 14 states and 1266 transitions.
[2022-01-19 05:00:25,475 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 876 flow
[2022-01-19 05:00:25,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 153 transitions, 728 flow, removed 55 selfloop flow, removed 18 redundant places.
[2022-01-19 05:00:25,481 INFO  L242             Difference]: Finished difference. Result has 142 places, 121 transitions, 470 flow
[2022-01-19 05:00:25,482 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=470, PETRI_PLACES=142, PETRI_TRANSITIONS=121}
[2022-01-19 05:00:25,482 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places.
[2022-01-19 05:00:25,482 INFO  L470      AbstractCegarLoop]: Abstraction has has 142 places, 121 transitions, 470 flow
[2022-01-19 05:00:25,483 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 87.78571428571429) internal successors, (1229), 14 states have internal predecessors, (1229), 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)
[2022-01-19 05:00:25,483 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:25,483 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:25,483 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-01-19 05:00:25,483 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:25,483 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:25,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 2089551402, now seen corresponding path program 2 times
[2022-01-19 05:00:25,483 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:25,484 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960936587]
[2022-01-19 05:00:25,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:25,484 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:25,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:25,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:25,635 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:25,636 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960936587]
[2022-01-19 05:00:25,636 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960936587] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:25,636 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:25,636 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-01-19 05:00:25,636 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120218300]
[2022-01-19 05:00:25,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:25,636 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-01-19 05:00:25,636 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:25,637 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-01-19 05:00:25,637 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-01-19 05:00:25,637 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 116
[2022-01-19 05:00:25,638 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 121 transitions, 470 flow. Second operand  has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 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)
[2022-01-19 05:00:25,638 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:25,638 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 116
[2022-01-19 05:00:25,638 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:25,879 INFO  L129       PetriNetUnfolder]: 163/738 cut-off events.
[2022-01-19 05:00:25,879 INFO  L130       PetriNetUnfolder]: For 791/871 co-relation queries the response was YES.
[2022-01-19 05:00:25,882 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 738 events. 163/738 cut-off events. For 791/871 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4864 event pairs, 29 based on Foata normal form. 12/726 useless extension candidates. Maximal degree in co-relation 1882. Up to 193 conditions per place. 
[2022-01-19 05:00:25,884 INFO  L132   encePairwiseOnDemand]: 104/116 looper letters, 40 selfloop transitions, 14 changer transitions 23/156 dead transitions.
[2022-01-19 05:00:25,884 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 156 transitions, 871 flow
[2022-01-19 05:00:25,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2022-01-19 05:00:25,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-01-19 05:00:25,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 844 transitions.
[2022-01-19 05:00:25,885 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8084291187739464
[2022-01-19 05:00:25,885 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 844 transitions.
[2022-01-19 05:00:25,885 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 844 transitions.
[2022-01-19 05:00:25,886 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:25,886 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 844 transitions.
[2022-01-19 05:00:25,888 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 93.77777777777777) internal successors, (844), 9 states have internal predecessors, (844), 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)
[2022-01-19 05:00:25,890 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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)
[2022-01-19 05:00:25,890 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 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)
[2022-01-19 05:00:25,890 INFO  L186             Difference]: Start difference. First operand has 142 places, 121 transitions, 470 flow. Second operand 9 states and 844 transitions.
[2022-01-19 05:00:25,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 156 transitions, 871 flow
[2022-01-19 05:00:25,893 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 156 transitions, 803 flow, removed 12 selfloop flow, removed 13 redundant places.
[2022-01-19 05:00:25,894 INFO  L242             Difference]: Finished difference. Result has 139 places, 129 transitions, 572 flow
[2022-01-19 05:00:25,895 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=572, PETRI_PLACES=139, PETRI_TRANSITIONS=129}
[2022-01-19 05:00:25,896 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2022-01-19 05:00:25,896 INFO  L470      AbstractCegarLoop]: Abstraction has has 139 places, 129 transitions, 572 flow
[2022-01-19 05:00:25,897 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 90.875) internal successors, (727), 8 states have internal predecessors, (727), 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)
[2022-01-19 05:00:25,897 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:25,897 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:25,897 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-01-19 05:00:25,897 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:25,897 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:25,897 INFO  L85        PathProgramCache]: Analyzing trace with hash 1048085846, now seen corresponding path program 3 times
[2022-01-19 05:00:25,897 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:25,897 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334642642]
[2022-01-19 05:00:25,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:25,898 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:25,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:26,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:26,141 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:26,141 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334642642]
[2022-01-19 05:00:26,141 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334642642] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:26,141 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:26,141 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-01-19 05:00:26,141 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762417581]
[2022-01-19 05:00:26,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:26,141 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-01-19 05:00:26,141 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:26,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-01-19 05:00:26,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2022-01-19 05:00:26,142 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 116
[2022-01-19 05:00:26,143 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 129 transitions, 572 flow. Second operand  has 13 states, 13 states have (on average 87.0) internal successors, (1131), 13 states have internal predecessors, (1131), 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)
[2022-01-19 05:00:26,143 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:26,143 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 116
[2022-01-19 05:00:26,143 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:26,511 INFO  L129       PetriNetUnfolder]: 157/773 cut-off events.
[2022-01-19 05:00:26,511 INFO  L130       PetriNetUnfolder]: For 976/1015 co-relation queries the response was YES.
[2022-01-19 05:00:26,514 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2044 conditions, 773 events. 157/773 cut-off events. For 976/1015 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5205 event pairs, 20 based on Foata normal form. 9/757 useless extension candidates. Maximal degree in co-relation 2020. Up to 97 conditions per place. 
[2022-01-19 05:00:26,515 INFO  L132   encePairwiseOnDemand]: 105/116 looper letters, 50 selfloop transitions, 9 changer transitions 26/161 dead transitions.
[2022-01-19 05:00:26,515 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 161 transitions, 943 flow
[2022-01-19 05:00:26,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2022-01-19 05:00:26,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2022-01-19 05:00:26,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 994 transitions.
[2022-01-19 05:00:26,517 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7789968652037618
[2022-01-19 05:00:26,517 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 994 transitions.
[2022-01-19 05:00:26,517 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 994 transitions.
[2022-01-19 05:00:26,518 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:26,518 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 994 transitions.
[2022-01-19 05:00:26,519 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 90.36363636363636) internal successors, (994), 11 states have internal predecessors, (994), 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)
[2022-01-19 05:00:26,520 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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)
[2022-01-19 05:00:26,521 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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)
[2022-01-19 05:00:26,521 INFO  L186             Difference]: Start difference. First operand has 139 places, 129 transitions, 572 flow. Second operand 11 states and 994 transitions.
[2022-01-19 05:00:26,521 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 161 transitions, 943 flow
[2022-01-19 05:00:26,523 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 161 transitions, 908 flow, removed 12 selfloop flow, removed 5 redundant places.
[2022-01-19 05:00:26,525 INFO  L242             Difference]: Finished difference. Result has 144 places, 117 transitions, 477 flow
[2022-01-19 05:00:26,525 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=477, PETRI_PLACES=144, PETRI_TRANSITIONS=117}
[2022-01-19 05:00:26,525 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 23 predicate places.
[2022-01-19 05:00:26,525 INFO  L470      AbstractCegarLoop]: Abstraction has has 144 places, 117 transitions, 477 flow
[2022-01-19 05:00:26,526 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.0) internal successors, (1131), 13 states have internal predecessors, (1131), 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)
[2022-01-19 05:00:26,526 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:26,526 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:26,526 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-01-19 05:00:26,526 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:26,526 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:26,527 INFO  L85        PathProgramCache]: Analyzing trace with hash -1206438814, now seen corresponding path program 4 times
[2022-01-19 05:00:26,527 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:26,527 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405334933]
[2022-01-19 05:00:26,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:26,527 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:26,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:26,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:26,667 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:26,667 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405334933]
[2022-01-19 05:00:26,667 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405334933] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:26,667 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:26,668 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-01-19 05:00:26,668 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050083055]
[2022-01-19 05:00:26,668 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:26,668 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-01-19 05:00:26,668 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:26,668 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-01-19 05:00:26,668 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2022-01-19 05:00:26,669 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 116
[2022-01-19 05:00:26,669 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 117 transitions, 477 flow. Second operand  has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 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)
[2022-01-19 05:00:26,669 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:26,670 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 116
[2022-01-19 05:00:26,670 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:26,957 INFO  L129       PetriNetUnfolder]: 110/643 cut-off events.
[2022-01-19 05:00:26,957 INFO  L130       PetriNetUnfolder]: For 628/665 co-relation queries the response was YES.
[2022-01-19 05:00:26,959 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 643 events. 110/643 cut-off events. For 628/665 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4208 event pairs, 12 based on Foata normal form. 13/644 useless extension candidates. Maximal degree in co-relation 1500. Up to 78 conditions per place. 
[2022-01-19 05:00:26,960 INFO  L132   encePairwiseOnDemand]: 106/116 looper letters, 47 selfloop transitions, 11 changer transitions 14/150 dead transitions.
[2022-01-19 05:00:26,960 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 150 transitions, 833 flow
[2022-01-19 05:00:26,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2022-01-19 05:00:26,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2022-01-19 05:00:26,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1013 transitions.
[2022-01-19 05:00:26,964 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7938871473354232
[2022-01-19 05:00:26,964 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1013 transitions.
[2022-01-19 05:00:26,964 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1013 transitions.
[2022-01-19 05:00:26,965 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:26,965 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1013 transitions.
[2022-01-19 05:00:26,966 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 92.0909090909091) internal successors, (1013), 11 states have internal predecessors, (1013), 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)
[2022-01-19 05:00:26,967 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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)
[2022-01-19 05:00:26,967 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 116.0) internal successors, (1392), 12 states have internal predecessors, (1392), 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)
[2022-01-19 05:00:26,967 INFO  L186             Difference]: Start difference. First operand has 144 places, 117 transitions, 477 flow. Second operand 11 states and 1013 transitions.
[2022-01-19 05:00:26,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 150 transitions, 833 flow
[2022-01-19 05:00:26,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 150 transitions, 738 flow, removed 25 selfloop flow, removed 13 redundant places.
[2022-01-19 05:00:26,981 INFO  L242             Difference]: Finished difference. Result has 142 places, 120 transitions, 494 flow
[2022-01-19 05:00:26,982 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=494, PETRI_PLACES=142, PETRI_TRANSITIONS=120}
[2022-01-19 05:00:26,982 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places.
[2022-01-19 05:00:26,982 INFO  L470      AbstractCegarLoop]: Abstraction has has 142 places, 120 transitions, 494 flow
[2022-01-19 05:00:26,982 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 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)
[2022-01-19 05:00:26,982 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:26,982 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:26,982 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-01-19 05:00:26,983 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:26,983 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:26,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -892590182, now seen corresponding path program 5 times
[2022-01-19 05:00:26,983 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:26,983 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118903321]
[2022-01-19 05:00:26,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:26,983 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:27,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:27,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:27,252 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:27,252 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118903321]
[2022-01-19 05:00:27,252 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118903321] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:27,252 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:27,252 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2022-01-19 05:00:27,252 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054698010]
[2022-01-19 05:00:27,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:27,253 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2022-01-19 05:00:27,253 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:27,253 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2022-01-19 05:00:27,253 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182
[2022-01-19 05:00:27,254 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 116
[2022-01-19 05:00:27,254 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 120 transitions, 494 flow. Second operand  has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 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)
[2022-01-19 05:00:27,255 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:27,255 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 116
[2022-01-19 05:00:27,255 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:27,656 INFO  L129       PetriNetUnfolder]: 123/725 cut-off events.
[2022-01-19 05:00:27,657 INFO  L130       PetriNetUnfolder]: For 597/620 co-relation queries the response was YES.
[2022-01-19 05:00:27,659 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 725 events. 123/725 cut-off events. For 597/620 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5180 event pairs, 6 based on Foata normal form. 7/718 useless extension candidates. Maximal degree in co-relation 1618. Up to 92 conditions per place. 
[2022-01-19 05:00:27,660 INFO  L132   encePairwiseOnDemand]: 103/116 looper letters, 41 selfloop transitions, 21 changer transitions 10/146 dead transitions.
[2022-01-19 05:00:27,660 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 811 flow
[2022-01-19 05:00:27,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2022-01-19 05:00:27,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2022-01-19 05:00:27,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1219 transitions.
[2022-01-19 05:00:27,662 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.750615763546798
[2022-01-19 05:00:27,662 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1219 transitions.
[2022-01-19 05:00:27,662 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1219 transitions.
[2022-01-19 05:00:27,662 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:27,662 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1219 transitions.
[2022-01-19 05:00:27,664 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 87.07142857142857) internal successors, (1219), 14 states have internal predecessors, (1219), 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)
[2022-01-19 05:00:27,665 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 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)
[2022-01-19 05:00:27,665 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 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)
[2022-01-19 05:00:27,665 INFO  L186             Difference]: Start difference. First operand has 142 places, 120 transitions, 494 flow. Second operand 14 states and 1219 transitions.
[2022-01-19 05:00:27,665 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 811 flow
[2022-01-19 05:00:27,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 146 transitions, 772 flow, removed 16 selfloop flow, removed 7 redundant places.
[2022-01-19 05:00:27,669 INFO  L242             Difference]: Finished difference. Result has 149 places, 127 transitions, 601 flow
[2022-01-19 05:00:27,669 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=601, PETRI_PLACES=149, PETRI_TRANSITIONS=127}
[2022-01-19 05:00:27,670 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 28 predicate places.
[2022-01-19 05:00:27,670 INFO  L470      AbstractCegarLoop]: Abstraction has has 149 places, 127 transitions, 601 flow
[2022-01-19 05:00:27,670 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 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)
[2022-01-19 05:00:27,670 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:27,670 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:27,670 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-01-19 05:00:27,671 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:27,671 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:27,671 INFO  L85        PathProgramCache]: Analyzing trace with hash 1811293316, now seen corresponding path program 6 times
[2022-01-19 05:00:27,671 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:27,671 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168281787]
[2022-01-19 05:00:27,671 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:27,671 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:27,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-01-19 05:00:27,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-01-19 05:00:27,859 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-01-19 05:00:27,859 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168281787]
[2022-01-19 05:00:27,859 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168281787] provided 1 perfect and 0 imperfect interpolant sequences
[2022-01-19 05:00:27,859 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-01-19 05:00:27,859 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2022-01-19 05:00:27,859 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390165830]
[2022-01-19 05:00:27,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-01-19 05:00:27,860 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2022-01-19 05:00:27,860 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-01-19 05:00:27,860 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2022-01-19 05:00:27,860 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2022-01-19 05:00:27,861 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 116
[2022-01-19 05:00:27,861 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 127 transitions, 601 flow. Second operand  has 13 states, 13 states have (on average 87.0) internal successors, (1131), 13 states have internal predecessors, (1131), 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)
[2022-01-19 05:00:27,861 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-01-19 05:00:27,861 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 116
[2022-01-19 05:00:27,861 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-01-19 05:00:28,148 INFO  L129       PetriNetUnfolder]: 160/981 cut-off events.
[2022-01-19 05:00:28,148 INFO  L130       PetriNetUnfolder]: For 941/964 co-relation queries the response was YES.
[2022-01-19 05:00:28,151 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 981 events. 160/981 cut-off events. For 941/964 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 8098 event pairs, 15 based on Foata normal form. 7/967 useless extension candidates. Maximal degree in co-relation 2133. Up to 138 conditions per place. 
[2022-01-19 05:00:28,153 INFO  L132   encePairwiseOnDemand]: 103/116 looper letters, 31 selfloop transitions, 12 changer transitions 28/147 dead transitions.
[2022-01-19 05:00:28,153 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 147 transitions, 874 flow
[2022-01-19 05:00:28,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2022-01-19 05:00:28,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2022-01-19 05:00:28,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1156 transitions.
[2022-01-19 05:00:28,155 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.76657824933687
[2022-01-19 05:00:28,156 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1156 transitions.
[2022-01-19 05:00:28,156 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1156 transitions.
[2022-01-19 05:00:28,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-01-19 05:00:28,156 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1156 transitions.
[2022-01-19 05:00:28,157 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 88.92307692307692) internal successors, (1156), 13 states have internal predecessors, (1156), 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)
[2022-01-19 05:00:28,158 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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)
[2022-01-19 05:00:28,159 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 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)
[2022-01-19 05:00:28,159 INFO  L186             Difference]: Start difference. First operand has 149 places, 127 transitions, 601 flow. Second operand 13 states and 1156 transitions.
[2022-01-19 05:00:28,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 147 transitions, 874 flow
[2022-01-19 05:00:28,162 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 147 transitions, 830 flow, removed 17 selfloop flow, removed 8 redundant places.
[2022-01-19 05:00:28,163 INFO  L242             Difference]: Finished difference. Result has 154 places, 117 transitions, 476 flow
[2022-01-19 05:00:28,163 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=476, PETRI_PLACES=154, PETRI_TRANSITIONS=117}
[2022-01-19 05:00:28,164 INFO  L334   CegarLoopForPetriNet]: 121 programPoint places, 33 predicate places.
[2022-01-19 05:00:28,164 INFO  L470      AbstractCegarLoop]: Abstraction has has 154 places, 117 transitions, 476 flow
[2022-01-19 05:00:28,164 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 87.0) internal successors, (1131), 13 states have internal predecessors, (1131), 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)
[2022-01-19 05:00:28,164 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2022-01-19 05:00:28,164 INFO  L254   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:28,164 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2022-01-19 05:00:28,164 INFO  L402      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2022-01-19 05:00:28,165 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-01-19 05:00:28,165 INFO  L85        PathProgramCache]: Analyzing trace with hash 1921726560, now seen corresponding path program 7 times
[2022-01-19 05:00:28,165 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-01-19 05:00:28,165 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905002049]
[2022-01-19 05:00:28,165 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-01-19 05:00:28,165 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-01-19 05:00:28,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-01-19 05:00:28,210 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-01-19 05:00:28,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-01-19 05:00:28,298 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-01-19 05:00:28,299 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2022-01-19 05:00:28,299 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2022-01-19 05:00:28,301 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2022-01-19 05:00:28,301 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining)
[2022-01-19 05:00:28,301 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining)
[2022-01-19 05:00:28,302 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining)
[2022-01-19 05:00:28,302 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2022-01-19 05:00:28,302 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-01-19 05:00:28,304 INFO  L732         BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-01-19 05:00:28,308 INFO  L230   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2022-01-19 05:00:28,308 INFO  L180   ceAbstractionStarter]: Computing trace abstraction results
[2022-01-19 05:00:28,417 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 05:00:28 BasicIcfg
[2022-01-19 05:00:28,418 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-01-19 05:00:28,418 INFO  L158              Benchmark]: Toolchain (without parser) took 12401.71ms. Allocated memory was 350.2MB in the beginning and 836.8MB in the end (delta: 486.5MB). Free memory was 295.5MB in the beginning and 389.0MB in the end (delta: -93.5MB). Peak memory consumption was 394.2MB. Max. memory is 16.0GB.
[2022-01-19 05:00:28,418 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 350.2MB. Free memory is still 313.5MB. There was no memory consumed. Max. memory is 16.0GB.
[2022-01-19 05:00:28,419 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 440.85ms. Allocated memory was 350.2MB in the beginning and 457.2MB in the end (delta: 107.0MB). Free memory was 295.4MB in the beginning and 415.3MB in the end (delta: -119.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB.
[2022-01-19 05:00:28,419 INFO  L158              Benchmark]: Boogie Procedure Inliner took 40.82ms. Allocated memory is still 457.2MB. Free memory was 415.3MB in the beginning and 412.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB.
[2022-01-19 05:00:28,419 INFO  L158              Benchmark]: Boogie Preprocessor took 57.58ms. Allocated memory is still 457.2MB. Free memory was 412.1MB in the beginning and 408.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB.
[2022-01-19 05:00:28,419 INFO  L158              Benchmark]: RCFGBuilder took 1137.86ms. Allocated memory is still 457.2MB. Free memory was 408.5MB in the beginning and 254.9MB in the end (delta: 153.6MB). Peak memory consumption was 153.1MB. Max. memory is 16.0GB.
[2022-01-19 05:00:28,420 INFO  L158              Benchmark]: TraceAbstraction took 10716.07ms. Allocated memory was 457.2MB in the beginning and 836.8MB in the end (delta: 379.6MB). Free memory was 254.9MB in the beginning and 389.0MB in the end (delta: -134.1MB). Peak memory consumption was 247.5MB. Max. memory is 16.0GB.
[2022-01-19 05:00:28,421 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.10ms. Allocated memory is still 350.2MB. Free memory is still 313.5MB. There was no memory consumed. Max. memory is 16.0GB.
 * CACSL2BoogieTranslator took 440.85ms. Allocated memory was 350.2MB in the beginning and 457.2MB in the end (delta: 107.0MB). Free memory was 295.4MB in the beginning and 415.3MB in the end (delta: -119.9MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB.
 * Boogie Procedure Inliner took 40.82ms. Allocated memory is still 457.2MB. Free memory was 415.3MB in the beginning and 412.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB.
 * Boogie Preprocessor took 57.58ms. Allocated memory is still 457.2MB. Free memory was 412.1MB in the beginning and 408.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB.
 * RCFGBuilder took 1137.86ms. Allocated memory is still 457.2MB. Free memory was 408.5MB in the beginning and 254.9MB in the end (delta: 153.6MB). Peak memory consumption was 153.1MB. Max. memory is 16.0GB.
 * TraceAbstraction took 10716.07ms. Allocated memory was 457.2MB in the beginning and 836.8MB in the end (delta: 379.6MB). Free memory was 254.9MB in the beginning and 389.0MB in the end (delta: -134.1MB). Peak memory consumption was 247.5MB. Max. memory is 16.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - 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;
        VAL             [__unbuffered_cnt=0]
[L712]               0  int __unbuffered_p0_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L714]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0]
[L716]               0  int __unbuffered_p2_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L717]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L718]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L720]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L722]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L723]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L724]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L725]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L726]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L727]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L728]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L729]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L730]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L731]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L732]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L733]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L734]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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}]
[L735]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L736]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L737]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L738]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=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]
[L739]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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]
[L740]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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]
[L854]               0  pthread_t t2321;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2321={5: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]
[L855]  FCALL, FORK  0  pthread_create(&t2321, ((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, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={5: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 t2322;
        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, t2321={5:0}, t2322={6: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]
[L857]  FCALL, FORK  0  pthread_create(&t2322, ((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, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={6: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
[L788]  CALL         2  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L788]  RET          2  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[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}, arg={0: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}, 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]
[L858]               0  pthread_t t2323;
        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, t2321={5:0}, t2322={6:0}, t2323={3: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]
[L859]  FCALL, FORK  0  pthread_create(&t2323, ((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, pthread_create(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={3: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=66, 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=66, 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
[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             [__unbuffered_cnt=0, __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=68, 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]
[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
[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
[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
[L806]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, 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]
[L777]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __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=68, 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]
[L839]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__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=0, main$tmp_guard1=0, weak$$choice0=68, 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]
[L861]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__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, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=68, 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]
[L863]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __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}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=68, 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]
[L863]  RET          0  assume_abort_if_not(main$tmp_guard0)
[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]               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]               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]               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]               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]               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]               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
        VAL             [__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, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=67, weak$$choice2=255, 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]
[L887]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(expression)=0, \old(expression)=1, __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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, 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]
[L19]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, __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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, 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]

  - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable
    Unable to prove that call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 788 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 788 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1665 mSDsCounter, 413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3145 IncrementalHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 413 mSolverCounterUnsat, 155 mSDtfsCounter, 3145 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=601occurred in iteration=15, InterpolantAutomatonStates: 180, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1421 NumberOfCodeBlocks, 1421 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1315 ConstructedInterpolants, 0 QuantifiedInterpolants, 7294 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!
[2022-01-19 05:00:28,456 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...